./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:47:12,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:47:12,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:47:12,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:47:12,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:47:12,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:47:12,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:47:12,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:47:12,920 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:47:12,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:47:12,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:47:12,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:47:12,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:47:12,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:47:12,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:47:12,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:47:12,932 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:47:12,933 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:47:12,934 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:47:12,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:47:12,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:47:12,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:47:12,941 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:47:12,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:47:12,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:47:12,945 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:47:12,945 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:47:12,946 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:47:12,946 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:47:12,947 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:47:12,947 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:47:12,948 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:47:12,949 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:47:12,950 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:47:12,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:47:12,951 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:47:12,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:47:12,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:47:12,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:47:12,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:47:12,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:47:12,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 19:47:12,978 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:47:12,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:47:12,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:47:12,979 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:47:12,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:47:12,980 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:47:12,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:47:12,981 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:47:12,981 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:47:12,981 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:47:12,982 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:47:12,982 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:47:12,982 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:47:12,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:47:12,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:47:12,982 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:47:12,982 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:47:12,983 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:47:12,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:47:12,983 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:47:12,983 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:47:12,983 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:47:12,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:47:12,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:47:12,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:47:12,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:47:12,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:47:12,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:47:12,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:47:12,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:47:12,985 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:47:12,985 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:47:12,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:47:12,985 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:47:12,985 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 19:47:13,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:47:13,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:47:13,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:47:13,223 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:47:13,223 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:47:13,224 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-29 19:47:14,172 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:47:14,366 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:47:14,366 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-29 19:47:14,374 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73658621/c2d0aa217c084c2bb88ac37791072127/FLAGba5c6256a [2023-08-29 19:47:14,382 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73658621/c2d0aa217c084c2bb88ac37791072127 [2023-08-29 19:47:14,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:47:14,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:47:14,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:47:14,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:47:14,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:47:14,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cfdb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14, skipping insertion in model container [2023-08-29 19:47:14,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:47:14,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:47:14,508 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:47:14,579 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-29 19:47:14,586 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:47:14,592 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:47:14,601 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:47:14,652 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-29 19:47:14,665 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:47:14,689 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:47:14,689 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:47:14,689 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:47:14,694 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:47:14,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14 WrapperNode [2023-08-29 19:47:14,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:47:14,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:47:14,695 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:47:14,695 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:47:14,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,741 INFO L138 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2023-08-29 19:47:14,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:47:14,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:47:14,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:47:14,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:47:14,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,776 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:47:14,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:47:14,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:47:14,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:47:14,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (1/1) ... [2023-08-29 19:47:14,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:47:14,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:47:14,810 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-29 19:47:14,830 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-29 19:47:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:47:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:47:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 19:47:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:47:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-08-29 19:47:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-08-29 19:47:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:47:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:47:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:47:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 19:47:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:47:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:47:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-08-29 19:47:14,841 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-08-29 19:47:14,841 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:47:14,979 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:47:14,981 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:47:15,190 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:47:15,216 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:47:15,220 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 19:47:15,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:47:15 BoogieIcfgContainer [2023-08-29 19:47:15,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:47:15,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:47:15,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:47:15,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:47:15,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:47:14" (1/3) ... [2023-08-29 19:47:15,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ba10c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:47:15, skipping insertion in model container [2023-08-29 19:47:15,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:14" (2/3) ... [2023-08-29 19:47:15,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ba10c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:47:15, skipping insertion in model container [2023-08-29 19:47:15,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:47:15" (3/3) ... [2023-08-29 19:47:15,228 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-08-29 19:47:15,238 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:47:15,239 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-29 19:47:15,239 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:47:15,325 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 19:47:15,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 292 flow [2023-08-29 19:47:15,407 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-08-29 19:47:15,409 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 19:47:15,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 126 events. 2/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-29 19:47:15,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 292 flow [2023-08-29 19:47:15,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 122 transitions, 268 flow [2023-08-29 19:47:15,421 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:47:15,432 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 122 transitions, 268 flow [2023-08-29 19:47:15,437 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 122 transitions, 268 flow [2023-08-29 19:47:15,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 122 transitions, 268 flow [2023-08-29 19:47:15,477 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-08-29 19:47:15,477 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 19:47:15,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 122 events. 2/122 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 161 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2023-08-29 19:47:15,481 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2023-08-29 19:47:18,489 INFO L134 LiptonReduction]: Checked pairs total: 11920 [2023-08-29 19:47:18,490 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-29 19:47:18,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:47:18,502 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;@1cc0de7c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:47:18,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-08-29 19:47:18,504 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 19:47:18,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:47:18,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:18,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:47:18,505 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:18,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:18,507 INFO L85 PathProgramCache]: Analyzing trace with hash 443, now seen corresponding path program 1 times [2023-08-29 19:47:18,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:18,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744789828] [2023-08-29 19:47:18,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:18,574 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-29 19:47:18,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:18,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744789828] [2023-08-29 19:47:18,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744789828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:18,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:47:18,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135923554] [2023-08-29 19:47:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:18,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:47:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:18,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:47:18,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:47:18,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 235 [2023-08-29 19:47:18,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:18,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:18,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 235 [2023-08-29 19:47:18,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:19,067 INFO L130 PetriNetUnfolder]: 3680/5648 cut-off events. [2023-08-29 19:47:19,067 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-08-29 19:47:19,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11093 conditions, 5648 events. 3680/5648 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 37067 event pairs, 3680 based on Foata normal form. 427/4694 useless extension candidates. Maximal degree in co-relation 8653. Up to 5216 conditions per place. [2023-08-29 19:47:19,094 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 43 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-08-29 19:47:19,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 220 flow [2023-08-29 19:47:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:47:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:47:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions. [2023-08-29 19:47:19,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5936170212765958 [2023-08-29 19:47:19,104 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 279 transitions. [2023-08-29 19:47:19,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 279 transitions. [2023-08-29 19:47:19,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:19,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 279 transitions. [2023-08-29 19:47:19,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 139.5) internal successors, (279), 2 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,110 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,111 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 146 flow. Second operand 2 states and 279 transitions. [2023-08-29 19:47:19,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 220 flow [2023-08-29 19:47:19,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 204 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 19:47:19,118 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 118 flow [2023-08-29 19:47:19,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-29 19:47:19,121 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 19:47:19,121 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 118 flow [2023-08-29 19:47:19,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:19,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:47:19,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:47:19,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:19,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 436444, now seen corresponding path program 1 times [2023-08-29 19:47:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846706282] [2023-08-29 19:47:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:19,325 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-29 19:47:19,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:19,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846706282] [2023-08-29 19:47:19,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846706282] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:19,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:19,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:19,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685094714] [2023-08-29 19:47:19,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:19,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:19,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:19,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:19,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:19,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-29 19:47:19,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:19,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-29 19:47:19,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:19,663 INFO L130 PetriNetUnfolder]: 3508/5398 cut-off events. [2023-08-29 19:47:19,664 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:19,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10430 conditions, 5398 events. 3508/5398 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35297 event pairs, 3508 based on Foata normal form. 0/4123 useless extension candidates. Maximal degree in co-relation 10427. Up to 4964 conditions per place. [2023-08-29 19:47:19,685 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-29 19:47:19,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 196 flow [2023-08-29 19:47:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-29 19:47:19,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2023-08-29 19:47:19,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-29 19:47:19,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-29 19:47:19,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:19,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-29 19:47:19,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,690 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-29 19:47:19,690 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-29 19:47:19,691 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 118 flow. Second operand 3 states and 376 transitions. [2023-08-29 19:47:19,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 196 flow [2023-08-29 19:47:19,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:19,692 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 118 flow [2023-08-29 19:47:19,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-29 19:47:19,693 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 19:47:19,693 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 118 flow [2023-08-29 19:47:19,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:19,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:47:19,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:47:19,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:19,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash 436443, now seen corresponding path program 1 times [2023-08-29 19:47:19,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:19,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544548953] [2023-08-29 19:47:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:19,807 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-29 19:47:19,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:19,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544548953] [2023-08-29 19:47:19,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544548953] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:19,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:19,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:19,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481859456] [2023-08-29 19:47:19,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:19,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:19,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:19,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:19,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-29 19:47:19,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:19,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:19,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-29 19:47:19,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:20,131 INFO L130 PetriNetUnfolder]: 3336/5148 cut-off events. [2023-08-29 19:47:20,131 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:20,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9933 conditions, 5148 events. 3336/5148 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33369 event pairs, 3336 based on Foata normal form. 0/3979 useless extension candidates. Maximal degree in co-relation 9929. Up to 4714 conditions per place. [2023-08-29 19:47:20,153 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-29 19:47:20,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 192 flow [2023-08-29 19:47:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-29 19:47:20,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5049645390070922 [2023-08-29 19:47:20,155 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-29 19:47:20,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-29 19:47:20,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:20,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-29 19:47:20,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:20,158 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-29 19:47:20,159 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-29 19:47:20,159 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 118 flow. Second operand 3 states and 356 transitions. [2023-08-29 19:47:20,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 192 flow [2023-08-29 19:47:20,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:20,161 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2023-08-29 19:47:20,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-29 19:47:20,162 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-08-29 19:47:20,164 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2023-08-29 19:47:20,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:20,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:20,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:47:20,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:47:20,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:20,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash 419433285, now seen corresponding path program 1 times [2023-08-29 19:47:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:20,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643650458] [2023-08-29 19:47:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:20,278 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-29 19:47:20,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:20,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643650458] [2023-08-29 19:47:20,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643650458] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:20,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:20,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:20,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837767113] [2023-08-29 19:47:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:20,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:20,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:20,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-29 19:47:20,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:20,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:20,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-29 19:47:20,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:20,601 INFO L130 PetriNetUnfolder]: 3292/5071 cut-off events. [2023-08-29 19:47:20,601 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:20,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9782 conditions, 5071 events. 3292/5071 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32702 event pairs, 3292 based on Foata normal form. 0/3938 useless extension candidates. Maximal degree in co-relation 9778. Up to 4640 conditions per place. [2023-08-29 19:47:20,619 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-29 19:47:20,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 184 flow [2023-08-29 19:47:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-29 19:47:20,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5276595744680851 [2023-08-29 19:47:20,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-29 19:47:20,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-29 19:47:20,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:20,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-29 19:47:20,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:20,627 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-29 19:47:20,628 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-29 19:47:20,628 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 372 transitions. [2023-08-29 19:47:20,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 184 flow [2023-08-29 19:47:20,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:20,629 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2023-08-29 19:47:20,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-29 19:47:20,630 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2023-08-29 19:47:20,631 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2023-08-29 19:47:20,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:20,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:20,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:47:20,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:47:20,631 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:20,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash 419433284, now seen corresponding path program 1 times [2023-08-29 19:47:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131345270] [2023-08-29 19:47:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:20,735 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-29 19:47:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131345270] [2023-08-29 19:47:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131345270] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239655026] [2023-08-29 19:47:20,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:20,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:20,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:20,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:20,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-29 19:47:20,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:20,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:20,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-29 19:47:20,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:21,025 INFO L130 PetriNetUnfolder]: 3248/4994 cut-off events. [2023-08-29 19:47:21,026 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:21,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9631 conditions, 4994 events. 3248/4994 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32159 event pairs, 3248 based on Foata normal form. 0/3897 useless extension candidates. Maximal degree in co-relation 9627. Up to 4566 conditions per place. [2023-08-29 19:47:21,047 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 33 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-29 19:47:21,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 176 flow [2023-08-29 19:47:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-08-29 19:47:21,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49929078014184397 [2023-08-29 19:47:21,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-08-29 19:47:21,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-08-29 19:47:21,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:21,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-08-29 19:47:21,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,050 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-29 19:47:21,051 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-29 19:47:21,051 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 352 transitions. [2023-08-29 19:47:21,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 176 flow [2023-08-29 19:47:21,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:21,053 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2023-08-29 19:47:21,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-29 19:47:21,054 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2023-08-29 19:47:21,055 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2023-08-29 19:47:21,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:21,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:21,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:47:21,055 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:21,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -651528159, now seen corresponding path program 1 times [2023-08-29 19:47:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602775773] [2023-08-29 19:47:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:21,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:21,116 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-29 19:47:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:21,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602775773] [2023-08-29 19:47:21,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602775773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:21,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:21,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260120536] [2023-08-29 19:47:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:21,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:21,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:21,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:21,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:21,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-29 19:47:21,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:21,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-29 19:47:21,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:21,398 INFO L130 PetriNetUnfolder]: 3148/4835 cut-off events. [2023-08-29 19:47:21,399 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:21,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9322 conditions, 4835 events. 3148/4835 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 31073 event pairs, 3148 based on Foata normal form. 0/3809 useless extension candidates. Maximal degree in co-relation 9318. Up to 4416 conditions per place. [2023-08-29 19:47:21,417 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-29 19:47:21,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 168 flow [2023-08-29 19:47:21,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-29 19:47:21,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219858156028369 [2023-08-29 19:47:21,419 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-29 19:47:21,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-29 19:47:21,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:21,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-29 19:47:21,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,421 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-29 19:47:21,421 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-29 19:47:21,421 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 368 transitions. [2023-08-29 19:47:21,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 168 flow [2023-08-29 19:47:21,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:21,422 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2023-08-29 19:47:21,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-29 19:47:21,423 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2023-08-29 19:47:21,423 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2023-08-29 19:47:21,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:21,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:21,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:47:21,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:21,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash -651528160, now seen corresponding path program 1 times [2023-08-29 19:47:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:21,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726956499] [2023-08-29 19:47:21,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:21,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:21,447 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-29 19:47:21,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726956499] [2023-08-29 19:47:21,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726956499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:21,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:21,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:21,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800408628] [2023-08-29 19:47:21,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:21,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:21,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:21,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:21,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:21,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 235 [2023-08-29 19:47:21,479 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:21,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 235 [2023-08-29 19:47:21,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:21,715 INFO L130 PetriNetUnfolder]: 3048/4676 cut-off events. [2023-08-29 19:47:21,716 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:21,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9013 conditions, 4676 events. 3048/4676 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 29881 event pairs, 3048 based on Foata normal form. 0/3721 useless extension candidates. Maximal degree in co-relation 9009. Up to 4266 conditions per place. [2023-08-29 19:47:21,733 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-29 19:47:21,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 160 flow [2023-08-29 19:47:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:21,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:21,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-29 19:47:21,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49361702127659574 [2023-08-29 19:47:21,735 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-29 19:47:21,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-29 19:47:21,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:21,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-29 19:47:21,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 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-29 19:47:21,737 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-29 19:47:21,737 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-29 19:47:21,737 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 348 transitions. [2023-08-29 19:47:21,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 160 flow [2023-08-29 19:47:21,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:21,739 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2023-08-29 19:47:21,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-29 19:47:21,739 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2023-08-29 19:47:21,739 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2023-08-29 19:47:21,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:21,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:21,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:47:21,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:21,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:21,740 INFO L85 PathProgramCache]: Analyzing trace with hash 911001492, now seen corresponding path program 1 times [2023-08-29 19:47:21,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473083496] [2023-08-29 19:47:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:21,775 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-29 19:47:21,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:21,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473083496] [2023-08-29 19:47:21,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473083496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:21,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:21,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:21,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307660116] [2023-08-29 19:47:21,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:21,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:21,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:21,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:21,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:21,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 19:47:21,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:21,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:21,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 19:47:21,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:23,173 INFO L130 PetriNetUnfolder]: 20551/31618 cut-off events. [2023-08-29 19:47:23,173 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES. [2023-08-29 19:47:23,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59925 conditions, 31618 events. 20551/31618 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 233872 event pairs, 3071 based on Foata normal form. 760/29108 useless extension candidates. Maximal degree in co-relation 59921. Up to 13923 conditions per place. [2023-08-29 19:47:23,292 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 158 selfloop transitions, 26 changer transitions 0/190 dead transitions. [2023-08-29 19:47:23,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 190 transitions, 787 flow [2023-08-29 19:47:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:47:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:47:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1140 transitions. [2023-08-29 19:47:23,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2023-08-29 19:47:23,295 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1140 transitions. [2023-08-29 19:47:23,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1140 transitions. [2023-08-29 19:47:23,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:23,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1140 transitions. [2023-08-29 19:47:23,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.66666666666667) internal successors, (1140), 9 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:23,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:23,300 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:23,300 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 9 states and 1140 transitions. [2023-08-29 19:47:23,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 190 transitions, 787 flow [2023-08-29 19:47:23,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 190 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:23,303 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 235 flow [2023-08-29 19:47:23,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-08-29 19:47:23,304 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 19:47:23,304 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 235 flow [2023-08-29 19:47:23,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:23,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:23,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:23,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:47:23,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:23,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 946675041, now seen corresponding path program 1 times [2023-08-29 19:47:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444883857] [2023-08-29 19:47:23,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:23,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:23,403 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-29 19:47:23,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:23,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444883857] [2023-08-29 19:47:23,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444883857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:23,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:23,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814229696] [2023-08-29 19:47:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:23,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:47:23,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:47:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:47:23,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 235 [2023-08-29 19:47:23,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:23,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:23,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 235 [2023-08-29 19:47:23,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:24,097 INFO L130 PetriNetUnfolder]: 8926/14112 cut-off events. [2023-08-29 19:47:24,098 INFO L131 PetriNetUnfolder]: For 3671/4828 co-relation queries the response was YES. [2023-08-29 19:47:24,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30801 conditions, 14112 events. 8926/14112 cut-off events. For 3671/4828 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 107056 event pairs, 7733 based on Foata normal form. 503/12170 useless extension candidates. Maximal degree in co-relation 30793. Up to 12491 conditions per place. [2023-08-29 19:47:24,163 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-29 19:47:24,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 299 flow [2023-08-29 19:47:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 310 transitions. [2023-08-29 19:47:24,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4397163120567376 [2023-08-29 19:47:24,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 310 transitions. [2023-08-29 19:47:24,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 310 transitions. [2023-08-29 19:47:24,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:24,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 310 transitions. [2023-08-29 19:47:24,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:24,166 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-29 19:47:24,166 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-29 19:47:24,166 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 235 flow. Second operand 3 states and 310 transitions. [2023-08-29 19:47:24,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 299 flow [2023-08-29 19:47:24,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 67 transitions, 299 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:24,174 INFO L231 Difference]: Finished difference. Result has 62 places, 67 transitions, 237 flow [2023-08-29 19:47:24,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=62, PETRI_TRANSITIONS=67} [2023-08-29 19:47:24,174 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-29 19:47:24,175 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 67 transitions, 237 flow [2023-08-29 19:47:24,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:24,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:24,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:24,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:47:24,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:24,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 946675042, now seen corresponding path program 1 times [2023-08-29 19:47:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65733501] [2023-08-29 19:47:24,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:24,201 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-29 19:47:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:24,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65733501] [2023-08-29 19:47:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65733501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:24,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:24,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539693790] [2023-08-29 19:47:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:24,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:24,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:24,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 19:47:24,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:24,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:24,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 19:47:24,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:24,689 INFO L130 PetriNetUnfolder]: 6262/10257 cut-off events. [2023-08-29 19:47:24,689 INFO L131 PetriNetUnfolder]: For 2760/3604 co-relation queries the response was YES. [2023-08-29 19:47:24,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22403 conditions, 10257 events. 6262/10257 cut-off events. For 2760/3604 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 77469 event pairs, 5377 based on Foata normal form. 353/9605 useless extension candidates. Maximal degree in co-relation 22394. Up to 8891 conditions per place. [2023-08-29 19:47:24,723 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 30 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 19:47:24,723 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 66 transitions, 299 flow [2023-08-29 19:47:24,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-29 19:47:24,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49361702127659574 [2023-08-29 19:47:24,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-29 19:47:24,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-29 19:47:24,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:24,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-29 19:47:24,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 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-29 19:47:24,726 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-29 19:47:24,727 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-29 19:47:24,727 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 237 flow. Second operand 3 states and 348 transitions. [2023-08-29 19:47:24,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 66 transitions, 299 flow [2023-08-29 19:47:24,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 66 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:24,732 INFO L231 Difference]: Finished difference. Result has 61 places, 66 transitions, 235 flow [2023-08-29 19:47:24,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=61, PETRI_TRANSITIONS=66} [2023-08-29 19:47:24,732 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 19:47:24,733 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 66 transitions, 235 flow [2023-08-29 19:47:24,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:24,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:24,733 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:24,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:47:24,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:24,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:24,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1830579763, now seen corresponding path program 1 times [2023-08-29 19:47:24,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:24,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249621468] [2023-08-29 19:47:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:24,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:24,765 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-29 19:47:24,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:24,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249621468] [2023-08-29 19:47:24,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249621468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:24,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:24,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:47:24,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788106950] [2023-08-29 19:47:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:24,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:24,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:24,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 235 [2023-08-29 19:47:24,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 66 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:24,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:24,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 235 [2023-08-29 19:47:24,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:25,129 INFO L130 PetriNetUnfolder]: 5010/8557 cut-off events. [2023-08-29 19:47:25,129 INFO L131 PetriNetUnfolder]: For 2425/2701 co-relation queries the response was YES. [2023-08-29 19:47:25,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19124 conditions, 8557 events. 5010/8557 cut-off events. For 2425/2701 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 66659 event pairs, 1317 based on Foata normal form. 906/8934 useless extension candidates. Maximal degree in co-relation 19115. Up to 3435 conditions per place. [2023-08-29 19:47:25,164 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 48 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2023-08-29 19:47:25,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 399 flow [2023-08-29 19:47:25,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-08-29 19:47:25,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517730496453901 [2023-08-29 19:47:25,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-08-29 19:47:25,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-08-29 19:47:25,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:25,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-08-29 19:47:25,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:25,168 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-29 19:47:25,168 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-29 19:47:25,168 INFO L175 Difference]: Start difference. First operand has 61 places, 66 transitions, 235 flow. Second operand 3 states and 389 transitions. [2023-08-29 19:47:25,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 399 flow [2023-08-29 19:47:25,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 86 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:25,177 INFO L231 Difference]: Finished difference. Result has 62 places, 66 transitions, 247 flow [2023-08-29 19:47:25,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=62, PETRI_TRANSITIONS=66} [2023-08-29 19:47:25,178 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-29 19:47:25,178 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 247 flow [2023-08-29 19:47:25,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:25,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:25,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:25,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:47:25,179 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:25,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:25,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2046481205, now seen corresponding path program 2 times [2023-08-29 19:47:25,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:25,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987402022] [2023-08-29 19:47:25,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:25,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:25,213 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-29 19:47:25,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:25,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987402022] [2023-08-29 19:47:25,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987402022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:25,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:25,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:47:25,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333367089] [2023-08-29 19:47:25,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:25,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:47:25,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:47:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:47:25,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 235 [2023-08-29 19:47:25,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:25,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:25,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 235 [2023-08-29 19:47:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:25,496 INFO L130 PetriNetUnfolder]: 2715/5346 cut-off events. [2023-08-29 19:47:25,496 INFO L131 PetriNetUnfolder]: For 3887/4043 co-relation queries the response was YES. [2023-08-29 19:47:25,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12873 conditions, 5346 events. 2715/5346 cut-off events. For 3887/4043 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 43228 event pairs, 661 based on Foata normal form. 450/5571 useless extension candidates. Maximal degree in co-relation 12863. Up to 1987 conditions per place. [2023-08-29 19:47:25,515 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 74 selfloop transitions, 9 changer transitions 0/116 dead transitions. [2023-08-29 19:47:25,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 116 transitions, 570 flow [2023-08-29 19:47:25,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:47:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:47:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2023-08-29 19:47:25,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5638297872340425 [2023-08-29 19:47:25,517 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2023-08-29 19:47:25,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2023-08-29 19:47:25,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:25,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2023-08-29 19:47:25,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-29 19:47:25,519 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-29 19:47:25,519 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-29 19:47:25,520 INFO L175 Difference]: Start difference. First operand has 62 places, 66 transitions, 247 flow. Second operand 4 states and 530 transitions. [2023-08-29 19:47:25,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 116 transitions, 570 flow [2023-08-29 19:47:25,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:25,527 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 313 flow [2023-08-29 19:47:25,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=313, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-08-29 19:47:25,528 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-08-29 19:47:25,528 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 313 flow [2023-08-29 19:47:25,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:25,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:25,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:25,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:47:25,529 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:25,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash -646347747, now seen corresponding path program 1 times [2023-08-29 19:47:25,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:25,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548097102] [2023-08-29 19:47:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:25,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:25,566 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-29 19:47:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548097102] [2023-08-29 19:47:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548097102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:25,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:25,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:25,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375191675] [2023-08-29 19:47:25,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:25,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:25,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:25,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:25,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:25,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 19:47:25,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:25,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:25,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 19:47:25,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:26,213 INFO L130 PetriNetUnfolder]: 4685/8502 cut-off events. [2023-08-29 19:47:26,213 INFO L131 PetriNetUnfolder]: For 7956/8206 co-relation queries the response was YES. [2023-08-29 19:47:26,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23039 conditions, 8502 events. 4685/8502 cut-off events. For 7956/8206 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 64399 event pairs, 824 based on Foata normal form. 494/8938 useless extension candidates. Maximal degree in co-relation 23027. Up to 4051 conditions per place. [2023-08-29 19:47:26,246 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 169 selfloop transitions, 47 changer transitions 0/226 dead transitions. [2023-08-29 19:47:26,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 226 transitions, 1375 flow [2023-08-29 19:47:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:47:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:47:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1117 transitions. [2023-08-29 19:47:26,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5281323877068558 [2023-08-29 19:47:26,249 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1117 transitions. [2023-08-29 19:47:26,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1117 transitions. [2023-08-29 19:47:26,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:26,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1117 transitions. [2023-08-29 19:47:26,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.11111111111111) internal successors, (1117), 9 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:26,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:26,254 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:26,254 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 313 flow. Second operand 9 states and 1117 transitions. [2023-08-29 19:47:26,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 226 transitions, 1375 flow [2023-08-29 19:47:26,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 226 transitions, 1375 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:26,267 INFO L231 Difference]: Finished difference. Result has 80 places, 111 transitions, 654 flow [2023-08-29 19:47:26,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=654, PETRI_PLACES=80, PETRI_TRANSITIONS=111} [2023-08-29 19:47:26,268 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2023-08-29 19:47:26,268 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 111 transitions, 654 flow [2023-08-29 19:47:26,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:26,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:26,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:26,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:47:26,268 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:26,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash -970375638, now seen corresponding path program 1 times [2023-08-29 19:47:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:26,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670397315] [2023-08-29 19:47:26,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:26,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:26,301 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-29 19:47:26,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670397315] [2023-08-29 19:47:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670397315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:26,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:26,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:26,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850634243] [2023-08-29 19:47:26,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:26,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:26,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:26,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 19:47:26,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 111 transitions, 654 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 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-29 19:47:26,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:26,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 19:47:26,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:27,007 INFO L130 PetriNetUnfolder]: 4698/8568 cut-off events. [2023-08-29 19:47:27,008 INFO L131 PetriNetUnfolder]: For 11767/11936 co-relation queries the response was YES. [2023-08-29 19:47:27,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26487 conditions, 8568 events. 4698/8568 cut-off events. For 11767/11936 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 65471 event pairs, 1098 based on Foata normal form. 225/8685 useless extension candidates. Maximal degree in co-relation 26468. Up to 4981 conditions per place. [2023-08-29 19:47:27,053 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 150 selfloop transitions, 51 changer transitions 0/211 dead transitions. [2023-08-29 19:47:27,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 211 transitions, 1489 flow [2023-08-29 19:47:27,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:47:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:47:27,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 879 transitions. [2023-08-29 19:47:27,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5343465045592705 [2023-08-29 19:47:27,056 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 879 transitions. [2023-08-29 19:47:27,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 879 transitions. [2023-08-29 19:47:27,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:27,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 879 transitions. [2023-08-29 19:47:27,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 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-29 19:47:27,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:27,060 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:27,060 INFO L175 Difference]: Start difference. First operand has 80 places, 111 transitions, 654 flow. Second operand 7 states and 879 transitions. [2023-08-29 19:47:27,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 211 transitions, 1489 flow [2023-08-29 19:47:27,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 211 transitions, 1487 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:27,093 INFO L231 Difference]: Finished difference. Result has 88 places, 122 transitions, 844 flow [2023-08-29 19:47:27,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=844, PETRI_PLACES=88, PETRI_TRANSITIONS=122} [2023-08-29 19:47:27,094 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2023-08-29 19:47:27,094 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 122 transitions, 844 flow [2023-08-29 19:47:27,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 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-29 19:47:27,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:27,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:27,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:47:27,095 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:27,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:27,095 INFO L85 PathProgramCache]: Analyzing trace with hash -541846048, now seen corresponding path program 1 times [2023-08-29 19:47:27,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:27,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519306869] [2023-08-29 19:47:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:27,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:27,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:27,128 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-29 19:47:27,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:47:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519306869] [2023-08-29 19:47:27,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519306869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:27,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368751884] [2023-08-29 19:47:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:27,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:27,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:47:27,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:27,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:27,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 19:47:27,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 122 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 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-29 19:47:27,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:27,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 19:47:27,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:27,878 INFO L130 PetriNetUnfolder]: 4717/8682 cut-off events. [2023-08-29 19:47:27,878 INFO L131 PetriNetUnfolder]: For 15193/15368 co-relation queries the response was YES. [2023-08-29 19:47:27,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28109 conditions, 8682 events. 4717/8682 cut-off events. For 15193/15368 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 66638 event pairs, 1385 based on Foata normal form. 225/8807 useless extension candidates. Maximal degree in co-relation 28087. Up to 4722 conditions per place. [2023-08-29 19:47:27,916 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 153 selfloop transitions, 53 changer transitions 0/218 dead transitions. [2023-08-29 19:47:27,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 218 transitions, 1678 flow [2023-08-29 19:47:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:47:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:47:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-29 19:47:27,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5313069908814589 [2023-08-29 19:47:27,918 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-29 19:47:27,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-29 19:47:27,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:27,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-29 19:47:27,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:27,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:27,922 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:27,922 INFO L175 Difference]: Start difference. First operand has 88 places, 122 transitions, 844 flow. Second operand 7 states and 874 transitions. [2023-08-29 19:47:27,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 218 transitions, 1678 flow [2023-08-29 19:47:27,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 218 transitions, 1657 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:47:27,956 INFO L231 Difference]: Finished difference. Result has 95 places, 133 transitions, 1020 flow [2023-08-29 19:47:27,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1020, PETRI_PLACES=95, PETRI_TRANSITIONS=133} [2023-08-29 19:47:27,957 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 23 predicate places. [2023-08-29 19:47:27,957 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1020 flow [2023-08-29 19:47:27,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 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-29 19:47:27,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:27,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 19:47:27,958 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:27,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash 177613271, now seen corresponding path program 1 times [2023-08-29 19:47:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:47:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104420170] [2023-08-29 19:47:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:47:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:47:27,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:47:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:47:27,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:47:27,996 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:47:27,997 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-08-29 19:47:27,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-08-29 19:47:27,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-08-29 19:47:27,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-08-29 19:47:27,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-08-29 19:47:28,000 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-08-29 19:47:28,001 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-08-29 19:47:28,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 19:47:28,001 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:28,004 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:47:28,004 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:47:28,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:47:28 BasicIcfg [2023-08-29 19:47:28,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:47:28,029 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:47:28,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:47:28,029 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:47:28,030 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:47:15" (3/4) ... [2023-08-29 19:47:28,031 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:47:28,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:47:28,031 INFO L158 Benchmark]: Toolchain (without parser) took 13646.84ms. Allocated memory was 69.2MB in the beginning and 2.5GB in the end (delta: 2.5GB). Free memory was 45.5MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 173.4MB. Max. memory is 16.1GB. [2023-08-29 19:47:28,032 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:47:28,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.95ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 42.0MB in the end (delta: 3.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2023-08-29 19:47:28,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 69.2MB. Free memory was 42.0MB in the beginning and 39.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:47:28,032 INFO L158 Benchmark]: Boogie Preprocessor took 41.90ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 38.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:47:28,032 INFO L158 Benchmark]: RCFGBuilder took 437.23ms. Allocated memory is still 69.2MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 107.3kB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2023-08-29 19:47:28,033 INFO L158 Benchmark]: TraceAbstraction took 12805.07ms. Allocated memory was 69.2MB in the beginning and 2.5GB in the end (delta: 2.5GB). Free memory was 37.4MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. [2023-08-29 19:47:28,033 INFO L158 Benchmark]: Witness Printer took 2.12ms. Allocated memory is still 2.5GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:47:28,034 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 54.5MB. Free memory was 32.0MB in the beginning and 31.9MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.95ms. Allocated memory is still 69.2MB. Free memory was 45.3MB in the beginning and 42.0MB in the end (delta: 3.3MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 69.2MB. Free memory was 42.0MB in the beginning and 39.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.90ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 38.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 437.23ms. Allocated memory is still 69.2MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 107.3kB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12805.07ms. Allocated memory was 69.2MB in the beginning and 2.5GB in the end (delta: 2.5GB). Free memory was 37.4MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 164.0MB. Max. memory is 16.1GB. * Witness Printer took 2.12ms. Allocated memory is still 2.5GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 133 PlacesBefore, 72 PlacesAfterwards, 122 TransitionsBefore, 61 TransitionsAfterwards, 3246 CoEnabledTransitionPairs, 5 FixpointIterations, 40 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 105 TotalNumberOfCompositions, 11920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5357, independent: 5116, independent conditional: 0, independent unconditional: 5116, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1675, independent: 1640, independent conditional: 0, independent unconditional: 1640, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5357, independent: 3476, independent conditional: 0, independent unconditional: 3476, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 1675, unknown conditional: 0, unknown unconditional: 1675] , Statistics on independence cache: Total cache size (in pairs): 443, Positive cache size: 421, Positive conditional cache size: 0, Positive unconditional cache size: 421, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 738]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 738. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L724] 2 int l; [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=1, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=1, t1={8:0}, t2={7:0}, t3={5:0}, t4={6:0}, w=0, x=0, y=0] [L724] 4 int l; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l [L745] 2 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=3, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 155 locations, 24 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1621 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1081 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2484 IncrementalHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 131 mSDtfsCounter, 2484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1020occurred in iteration=15, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 19:47:28,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:47:29,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:47:29,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:47:29,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:47:29,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:47:29,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:47:29,713 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:47:29,715 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:47:29,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:47:29,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:47:29,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:47:29,722 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:47:29,723 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:47:29,724 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:47:29,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:47:29,729 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:47:29,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:47:29,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:47:29,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:47:29,735 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:47:29,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:47:29,750 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:47:29,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:47:29,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:47:29,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:47:29,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:47:29,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:47:29,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:47:29,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:47:29,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:47:29,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:47:29,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:47:29,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:47:29,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:47:29,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:47:29,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:47:29,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:47:29,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:47:29,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:47:29,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:47:29,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:47:29,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 19:47:29,783 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:47:29,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:47:29,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:47:29,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:47:29,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:47:29,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:47:29,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:47:29,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:47:29,785 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:47:29,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:47:29,786 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:47:29,786 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:47:29,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:47:29,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:47:29,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:47:29,786 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:47:29,786 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:47:29,787 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:47:29,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:47:29,788 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:47:29,788 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 19:47:29,791 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 19:47:29,791 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:47:29,792 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:47:29,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:47:29,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:47:29,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:47:29,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:47:29,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:47:29,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:47:29,793 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 19:47:29,793 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 19:47:29,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:47:29,794 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:47:29,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:47:29,794 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 19:47:29,794 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:47:29,794 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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 19:47:30,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:47:30,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:47:30,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:47:30,044 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:47:30,044 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:47:30,045 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-29 19:47:30,968 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:47:31,209 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:47:31,209 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-08-29 19:47:31,220 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5db801d/147303f914514af2a9aa256cc247e09b/FLAG1796fed8b [2023-08-29 19:47:31,229 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa5db801d/147303f914514af2a9aa256cc247e09b [2023-08-29 19:47:31,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:47:31,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:47:31,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:47:31,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:47:31,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:47:31,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cfc0748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31, skipping insertion in model container [2023-08-29 19:47:31,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:47:31,272 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:47:31,366 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:47:31,435 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-29 19:47:31,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:47:31,449 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:47:31,458 WARN L633 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-08-29 19:47:31,472 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-atomic/read_write_lock-2.i[31244,31257] [2023-08-29 19:47:31,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:47:31,494 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:47:31,494 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:47:31,494 WARN L667 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 19:47:31,499 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:47:31,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31 WrapperNode [2023-08-29 19:47:31,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:47:31,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:47:31,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:47:31,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:47:31,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,584 INFO L138 Inliner]: procedures = 177, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2023-08-29 19:47:31,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:47:31,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:47:31,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:47:31,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:47:31,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,621 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:47:31,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:47:31,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:47:31,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:47:31,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (1/1) ... [2023-08-29 19:47:31,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:47:31,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:47:31,660 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-29 19:47:31,680 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-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-08-29 19:47:31,688 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:47:31,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:47:31,688 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-08-29 19:47:31,689 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-08-29 19:47:31,689 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:47:31,841 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:47:31,842 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:47:32,051 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:47:32,071 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:47:32,072 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 19:47:32,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:47:32 BoogieIcfgContainer [2023-08-29 19:47:32,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:47:32,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:47:32,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:47:32,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:47:32,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:47:31" (1/3) ... [2023-08-29 19:47:32,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbd85a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:47:32, skipping insertion in model container [2023-08-29 19:47:32,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:47:31" (2/3) ... [2023-08-29 19:47:32,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fbd85a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:47:32, skipping insertion in model container [2023-08-29 19:47:32,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:47:32" (3/3) ... [2023-08-29 19:47:32,085 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-08-29 19:47:32,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:47:32,095 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-29 19:47:32,095 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:47:32,166 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-29 19:47:32,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 294 flow [2023-08-29 19:47:32,249 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-29 19:47:32,251 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 19:47:32,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 127 events. 2/127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 162 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-29 19:47:32,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 294 flow [2023-08-29 19:47:32,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 270 flow [2023-08-29 19:47:32,263 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:47:32,275 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 270 flow [2023-08-29 19:47:32,278 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 270 flow [2023-08-29 19:47:32,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 270 flow [2023-08-29 19:47:32,296 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-08-29 19:47:32,296 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-29 19:47:32,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 123 events. 2/123 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 161 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-29 19:47:32,299 INFO L119 LiptonReduction]: Number of co-enabled transitions 3246 [2023-08-29 19:47:39,907 INFO L134 LiptonReduction]: Checked pairs total: 11920 [2023-08-29 19:47:39,908 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-29 19:47:39,917 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:47:39,921 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;@23eb1cb8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:47:39,921 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-08-29 19:47:39,923 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 19:47:39,923 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:47:39,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:39,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 19:47:39,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:39,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:39,929 INFO L85 PathProgramCache]: Analyzing trace with hash 445, now seen corresponding path program 1 times [2023-08-29 19:47:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:39,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716812101] [2023-08-29 19:47:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:39,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:39,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:39,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 19:47:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:39,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 19:47:39,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:39,991 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-29 19:47:39,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:39,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:39,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716812101] [2023-08-29 19:47:39,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716812101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:39,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:39,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 19:47:39,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038207119] [2023-08-29 19:47:39,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:40,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 19:47:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 19:47:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 19:47:40,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 235 [2023-08-29 19:47:40,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:40,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:40,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 235 [2023-08-29 19:47:40,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:40,521 INFO L130 PetriNetUnfolder]: 3680/5684 cut-off events. [2023-08-29 19:47:40,522 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2023-08-29 19:47:40,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11129 conditions, 5684 events. 3680/5684 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 37534 event pairs, 3680 based on Foata normal form. 427/4754 useless extension candidates. Maximal degree in co-relation 8689. Up to 5216 conditions per place. [2023-08-29 19:47:40,549 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 43 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-08-29 19:47:40,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 220 flow [2023-08-29 19:47:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 19:47:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 19:47:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 281 transitions. [2023-08-29 19:47:40,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.597872340425532 [2023-08-29 19:47:40,558 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 281 transitions. [2023-08-29 19:47:40,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 281 transitions. [2023-08-29 19:47:40,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:40,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 281 transitions. [2023-08-29 19:47:40,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 140.5) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:40,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:40,565 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:40,566 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 146 flow. Second operand 2 states and 281 transitions. [2023-08-29 19:47:40,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 220 flow [2023-08-29 19:47:40,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 204 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-29 19:47:40,572 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 118 flow [2023-08-29 19:47:40,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-29 19:47:40,575 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 19:47:40,575 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 118 flow [2023-08-29 19:47:40,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.5) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:40,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:40,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:47:40,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:40,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:40,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:40,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash 435539, now seen corresponding path program 1 times [2023-08-29 19:47:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:40,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314200124] [2023-08-29 19:47:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:40,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:40,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:40,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:40,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 19:47:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:40,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 19:47:40,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:40,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:47:40,996 INFO L321 Elim1Store]: treesize reduction 63, result has 32.3 percent of original size [2023-08-29 19:47:40,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 35 [2023-08-29 19:47:41,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-29 19:47:41,091 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-29 19:47:41,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:41,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314200124] [2023-08-29 19:47:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314200124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:41,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:41,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93447341] [2023-08-29 19:47:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:41,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:41,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:41,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:41,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-08-29 19:47:41,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:41,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:41,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-08-29 19:47:41,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:41,547 INFO L130 PetriNetUnfolder]: 3508/5434 cut-off events. [2023-08-29 19:47:41,548 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:41,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 5434 events. 3508/5434 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35519 event pairs, 3508 based on Foata normal form. 0/4183 useless extension candidates. Maximal degree in co-relation 10463. Up to 4964 conditions per place. [2023-08-29 19:47:41,569 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-29 19:47:41,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 196 flow [2023-08-29 19:47:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-29 19:47:41,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375886524822695 [2023-08-29 19:47:41,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-29 19:47:41,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-29 19:47:41,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:41,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-29 19:47:41,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:41,578 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-29 19:47:41,579 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-29 19:47:41,579 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 118 flow. Second operand 3 states and 379 transitions. [2023-08-29 19:47:41,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 196 flow [2023-08-29 19:47:41,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 196 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:41,581 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 118 flow [2023-08-29 19:47:41,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-08-29 19:47:41,581 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-08-29 19:47:41,582 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 118 flow [2023-08-29 19:47:41,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:41,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:41,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 19:47:41,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-29 19:47:41,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:41,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:41,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:41,792 INFO L85 PathProgramCache]: Analyzing trace with hash 435541, now seen corresponding path program 1 times [2023-08-29 19:47:41,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:41,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192670371] [2023-08-29 19:47:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:41,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:41,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:41,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:41,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 19:47:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:41,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-29 19:47:41,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:41,891 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-29 19:47:41,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 40 [2023-08-29 19:47:41,954 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-29 19:47:41,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:41,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192670371] [2023-08-29 19:47:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192670371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:41,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:41,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:41,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014223148] [2023-08-29 19:47:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:41,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:41,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:41,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:41,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:42,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 235 [2023-08-29 19:47:42,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:42,062 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:42,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 235 [2023-08-29 19:47:42,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:42,414 INFO L130 PetriNetUnfolder]: 3336/5184 cut-off events. [2023-08-29 19:47:42,414 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:42,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9969 conditions, 5184 events. 3336/5184 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33583 event pairs, 3336 based on Foata normal form. 0/4039 useless extension candidates. Maximal degree in co-relation 9965. Up to 4714 conditions per place. [2023-08-29 19:47:42,435 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 37 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-29 19:47:42,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 192 flow [2023-08-29 19:47:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:42,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-29 19:47:42,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219858156028369 [2023-08-29 19:47:42,436 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-29 19:47:42,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-29 19:47:42,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:42,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-29 19:47:42,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:42,438 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-29 19:47:42,439 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-29 19:47:42,439 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 118 flow. Second operand 3 states and 368 transitions. [2023-08-29 19:47:42,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 192 flow [2023-08-29 19:47:42,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:42,441 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2023-08-29 19:47:42,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-29 19:47:42,443 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-08-29 19:47:42,443 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2023-08-29 19:47:42,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:42,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:42,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:47:42,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-29 19:47:42,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:42,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:42,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:42,651 INFO L85 PathProgramCache]: Analyzing trace with hash 418563642, now seen corresponding path program 1 times [2023-08-29 19:47:42,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:42,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465406172] [2023-08-29 19:47:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:42,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:42,652 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:42,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 19:47:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:42,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 19:47:42,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:42,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:47:42,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:47:42,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:47:42,767 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-29 19:47:42,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 32 [2023-08-29 19:47:42,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-08-29 19:47:42,796 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-29 19:47:42,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:42,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465406172] [2023-08-29 19:47:42,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465406172] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:42,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:42,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650951735] [2023-08-29 19:47:42,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:42,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:42,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:42,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:42,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-08-29 19:47:42,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:42,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:42,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-08-29 19:47:42,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:43,160 INFO L130 PetriNetUnfolder]: 3292/5107 cut-off events. [2023-08-29 19:47:43,160 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:43,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9818 conditions, 5107 events. 3292/5107 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 33113 event pairs, 3292 based on Foata normal form. 0/3998 useless extension candidates. Maximal degree in co-relation 9814. Up to 4640 conditions per place. [2023-08-29 19:47:43,176 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-29 19:47:43,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 184 flow [2023-08-29 19:47:43,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:43,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-29 19:47:43,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2023-08-29 19:47:43,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-29 19:47:43,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-29 19:47:43,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:43,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-29 19:47:43,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:43,180 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-29 19:47:43,181 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-29 19:47:43,181 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 375 transitions. [2023-08-29 19:47:43,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 184 flow [2023-08-29 19:47:43,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:43,182 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2023-08-29 19:47:43,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-29 19:47:43,184 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2023-08-29 19:47:43,184 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2023-08-29 19:47:43,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:43,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:43,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:47:43,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:43,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:43,391 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:43,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:43,391 INFO L85 PathProgramCache]: Analyzing trace with hash 418563641, now seen corresponding path program 1 times [2023-08-29 19:47:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:43,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542918511] [2023-08-29 19:47:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:43,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:43,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:43,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:43,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 19:47:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:43,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-29 19:47:43,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:43,494 INFO L321 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2023-08-29 19:47:43,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 29 [2023-08-29 19:47:43,514 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-29 19:47:43,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:43,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:43,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542918511] [2023-08-29 19:47:43,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542918511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:43,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:43,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:43,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334707891] [2023-08-29 19:47:43,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:43,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:43,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:43,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 19:47:43,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 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-29 19:47:43,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:43,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 19:47:43,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:43,857 INFO L130 PetriNetUnfolder]: 3248/5030 cut-off events. [2023-08-29 19:47:43,857 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:43,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9667 conditions, 5030 events. 3248/5030 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 32516 event pairs, 3248 based on Foata normal form. 0/3957 useless extension candidates. Maximal degree in co-relation 9663. Up to 4566 conditions per place. [2023-08-29 19:47:43,875 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 33 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-29 19:47:43,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 176 flow [2023-08-29 19:47:43,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:43,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-08-29 19:47:43,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035460992907801 [2023-08-29 19:47:43,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-08-29 19:47:43,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-08-29 19:47:43,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:43,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-08-29 19:47:43,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:43,879 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-29 19:47:43,879 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-29 19:47:43,879 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 355 transitions. [2023-08-29 19:47:43,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 176 flow [2023-08-29 19:47:43,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:43,881 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2023-08-29 19:47:43,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-29 19:47:43,883 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -17 predicate places. [2023-08-29 19:47:43,884 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2023-08-29 19:47:43,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-29 19:47:43,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:43,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:43,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:44,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:44,091 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:44,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1487255018, now seen corresponding path program 1 times [2023-08-29 19:47:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821242842] [2023-08-29 19:47:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:44,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:44,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:44,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:44,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 19:47:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:44,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:47:44,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:44,212 INFO L321 Elim1Store]: treesize reduction 84, result has 33.9 percent of original size [2023-08-29 19:47:44,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 50 [2023-08-29 19:47:44,235 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-29 19:47:44,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:44,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:44,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821242842] [2023-08-29 19:47:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821242842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:44,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607355462] [2023-08-29 19:47:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:44,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:44,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:44,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:44,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-29 19:47:44,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:44,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:44,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-29 19:47:44,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:44,562 INFO L130 PetriNetUnfolder]: 3148/4859 cut-off events. [2023-08-29 19:47:44,562 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:44,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9346 conditions, 4859 events. 3148/4859 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 31349 event pairs, 3148 based on Foata normal form. 0/3845 useless extension candidates. Maximal degree in co-relation 9342. Up to 4416 conditions per place. [2023-08-29 19:47:44,577 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-29 19:47:44,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 168 flow [2023-08-29 19:47:44,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-29 19:47:44,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.500709219858156 [2023-08-29 19:47:44,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-29 19:47:44,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-29 19:47:44,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:44,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-29 19:47:44,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:44,582 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-29 19:47:44,582 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-29 19:47:44,582 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 353 transitions. [2023-08-29 19:47:44,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 168 flow [2023-08-29 19:47:44,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:44,584 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2023-08-29 19:47:44,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-08-29 19:47:44,585 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -19 predicate places. [2023-08-29 19:47:44,585 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2023-08-29 19:47:44,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:44,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:44,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:44,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:44,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:44,792 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:44,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:44,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1487255019, now seen corresponding path program 1 times [2023-08-29 19:47:44,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:44,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108700840] [2023-08-29 19:47:44,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:44,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:44,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:44,794 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:44,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 19:47:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:44,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:47:44,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:44,909 INFO L321 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-29 19:47:44,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-29 19:47:44,935 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-29 19:47:44,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:44,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:44,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108700840] [2023-08-29 19:47:44,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108700840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:44,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:44,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596036423] [2023-08-29 19:47:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:44,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:44,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:44,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 235 [2023-08-29 19:47:44,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:44,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:44,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 235 [2023-08-29 19:47:44,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:45,239 INFO L130 PetriNetUnfolder]: 3048/4688 cut-off events. [2023-08-29 19:47:45,240 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 19:47:45,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9025 conditions, 4688 events. 3048/4688 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 30049 event pairs, 3048 based on Foata normal form. 0/3733 useless extension candidates. Maximal degree in co-relation 9021. Up to 4266 conditions per place. [2023-08-29 19:47:45,255 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-29 19:47:45,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 160 flow [2023-08-29 19:47:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-29 19:47:45,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234042553191489 [2023-08-29 19:47:45,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-29 19:47:45,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-29 19:47:45,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:45,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-29 19:47:45,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:45,259 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-29 19:47:45,259 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-29 19:47:45,259 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 369 transitions. [2023-08-29 19:47:45,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 160 flow [2023-08-29 19:47:45,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:45,260 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2023-08-29 19:47:45,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-29 19:47:45,261 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -21 predicate places. [2023-08-29 19:47:45,261 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2023-08-29 19:47:45,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:45,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:45,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:45,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:45,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:45,468 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:45,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:45,468 INFO L85 PathProgramCache]: Analyzing trace with hash 939144973, now seen corresponding path program 1 times [2023-08-29 19:47:45,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:45,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678069749] [2023-08-29 19:47:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:45,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:45,469 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:45,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 19:47:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:45,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:47:45,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:45,574 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-29 19:47:45,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:45,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678069749] [2023-08-29 19:47:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678069749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:45,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:45,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:45,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639234571] [2023-08-29 19:47:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:45,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:47:45,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:45,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:47:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:47:45,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-29 19:47:45,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:45,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:45,613 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-29 19:47:45,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:46,525 INFO L130 PetriNetUnfolder]: 12125/18416 cut-off events. [2023-08-29 19:47:46,525 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2023-08-29 19:47:46,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34957 conditions, 18416 events. 12125/18416 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 121053 event pairs, 3755 based on Foata normal form. 172/16666 useless extension candidates. Maximal degree in co-relation 34953. Up to 12167 conditions per place. [2023-08-29 19:47:46,590 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 127 selfloop transitions, 28 changer transitions 0/161 dead transitions. [2023-08-29 19:47:46,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 161 transitions, 653 flow [2023-08-29 19:47:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 19:47:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 19:47:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1227 transitions. [2023-08-29 19:47:46,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.522127659574468 [2023-08-29 19:47:46,593 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1227 transitions. [2023-08-29 19:47:46,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1227 transitions. [2023-08-29 19:47:46,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:46,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1227 transitions. [2023-08-29 19:47:46,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.7) internal successors, (1227), 10 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:46,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:46,598 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 235.0) internal successors, (2585), 11 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:46,598 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 10 states and 1227 transitions. [2023-08-29 19:47:46,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 161 transitions, 653 flow [2023-08-29 19:47:46,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 161 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:46,600 INFO L231 Difference]: Finished difference. Result has 62 places, 70 transitions, 243 flow [2023-08-29 19:47:46,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=243, PETRI_PLACES=62, PETRI_TRANSITIONS=70} [2023-08-29 19:47:46,601 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-29 19:47:46,601 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 70 transitions, 243 flow [2023-08-29 19:47:46,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:46,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:46,601 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:46,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:46,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:46,810 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:46,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 972047959, now seen corresponding path program 1 times [2023-08-29 19:47:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526556314] [2023-08-29 19:47:46,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:46,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:46,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:46,812 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:46,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 19:47:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:46,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-29 19:47:46,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:46,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:47:46,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:47:46,952 INFO L321 Elim1Store]: treesize reduction 53, result has 25.4 percent of original size [2023-08-29 19:47:46,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 28 [2023-08-29 19:47:46,980 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-29 19:47:46,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 312 treesize of output 312 [2023-08-29 19:47:47,173 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-29 19:47:47,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:47,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:47,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526556314] [2023-08-29 19:47:47,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526556314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:47,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:47,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:47:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864441535] [2023-08-29 19:47:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:47,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:47,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:47,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:47,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 235 [2023-08-29 19:47:47,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 70 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 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-29 19:47:47,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:47,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 235 [2023-08-29 19:47:47,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:47,646 INFO L130 PetriNetUnfolder]: 5221/8184 cut-off events. [2023-08-29 19:47:47,647 INFO L131 PetriNetUnfolder]: For 1989/2289 co-relation queries the response was YES. [2023-08-29 19:47:47,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17497 conditions, 8184 events. 5221/8184 cut-off events. For 1989/2289 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 55874 event pairs, 4685 based on Foata normal form. 86/6888 useless extension candidates. Maximal degree in co-relation 17489. Up to 7218 conditions per place. [2023-08-29 19:47:47,683 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 31 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-08-29 19:47:47,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 307 flow [2023-08-29 19:47:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:47,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-29 19:47:47,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.524822695035461 [2023-08-29 19:47:47,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-29 19:47:47,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-29 19:47:47,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:47,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-29 19:47:47,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:47,687 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-29 19:47:47,687 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-29 19:47:47,687 INFO L175 Difference]: Start difference. First operand has 62 places, 70 transitions, 243 flow. Second operand 3 states and 370 transitions. [2023-08-29 19:47:47,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 307 flow [2023-08-29 19:47:47,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 307 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:47,691 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 245 flow [2023-08-29 19:47:47,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2023-08-29 19:47:47,691 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-08-29 19:47:47,691 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 245 flow [2023-08-29 19:47:47,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 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-29 19:47:47,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:47,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:47,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:47,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:47,899 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:47,899 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash 972047960, now seen corresponding path program 1 times [2023-08-29 19:47:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:47,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958558796] [2023-08-29 19:47:47,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:47,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:47,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:47,900 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:47,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 19:47:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:47,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 19:47:47,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:48,018 INFO L321 Elim1Store]: treesize reduction 93, result has 26.8 percent of original size [2023-08-29 19:47:48,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2023-08-29 19:47:48,100 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-29 19:47:48,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:48,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:48,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958558796] [2023-08-29 19:47:48,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958558796] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:48,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:48,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:47:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706157109] [2023-08-29 19:47:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:48,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:48,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-29 19:47:48,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 245 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:48,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:48,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-29 19:47:48,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:48,551 INFO L130 PetriNetUnfolder]: 3640/5912 cut-off events. [2023-08-29 19:47:48,551 INFO L131 PetriNetUnfolder]: For 1497/1706 co-relation queries the response was YES. [2023-08-29 19:47:48,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12646 conditions, 5912 events. 3640/5912 cut-off events. For 1497/1706 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 39900 event pairs, 3240 based on Foata normal form. 56/5426 useless extension candidates. Maximal degree in co-relation 12637. Up to 5088 conditions per place. [2023-08-29 19:47:48,568 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 30 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-29 19:47:48,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 307 flow [2023-08-29 19:47:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 324 transitions. [2023-08-29 19:47:48,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595744680851064 [2023-08-29 19:47:48,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 324 transitions. [2023-08-29 19:47:48,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 324 transitions. [2023-08-29 19:47:48,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:48,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 324 transitions. [2023-08-29 19:47:48,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:48,576 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-29 19:47:48,577 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-29 19:47:48,577 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 245 flow. Second operand 3 states and 324 transitions. [2023-08-29 19:47:48,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 307 flow [2023-08-29 19:47:48,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:48,580 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 243 flow [2023-08-29 19:47:48,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2023-08-29 19:47:48,581 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-08-29 19:47:48,581 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 243 flow [2023-08-29 19:47:48,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:48,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:48,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:48,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:48,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:48,788 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:48,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash -322596182, now seen corresponding path program 1 times [2023-08-29 19:47:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:48,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906790573] [2023-08-29 19:47:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:48,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:48,789 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:48,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 19:47:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:48,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:47:48,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:48,851 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-29 19:47:48,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:48,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906790573] [2023-08-29 19:47:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906790573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:47:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648614761] [2023-08-29 19:47:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:48,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:47:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:47:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:47:48,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-29 19:47:48,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:48,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:48,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-29 19:47:48,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:49,107 INFO L130 PetriNetUnfolder]: 2817/4825 cut-off events. [2023-08-29 19:47:49,108 INFO L131 PetriNetUnfolder]: For 1389/1514 co-relation queries the response was YES. [2023-08-29 19:47:49,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10579 conditions, 4825 events. 2817/4825 cut-off events. For 1389/1514 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 34283 event pairs, 879 based on Foata normal form. 530/4962 useless extension candidates. Maximal degree in co-relation 10570. Up to 1925 conditions per place. [2023-08-29 19:47:49,125 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 48 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-08-29 19:47:49,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 407 flow [2023-08-29 19:47:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:47:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:47:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-08-29 19:47:49,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560283687943263 [2023-08-29 19:47:49,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-08-29 19:47:49,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-08-29 19:47:49,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:49,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-08-29 19:47:49,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 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-29 19:47:49,128 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-29 19:47:49,128 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-29 19:47:49,128 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 243 flow. Second operand 3 states and 392 transitions. [2023-08-29 19:47:49,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 407 flow [2023-08-29 19:47:49,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:49,134 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 255 flow [2023-08-29 19:47:49,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2023-08-29 19:47:49,134 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-08-29 19:47:49,134 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 255 flow [2023-08-29 19:47:49,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:49,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:49,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:49,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:49,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:49,341 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:49,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -940144752, now seen corresponding path program 2 times [2023-08-29 19:47:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75257840] [2023-08-29 19:47:49,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 19:47:49,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:49,342 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:49,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 19:47:49,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 19:47:49,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 19:47:49,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:47:49,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:49,411 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-29 19:47:49,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:49,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:49,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75257840] [2023-08-29 19:47:49,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75257840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:49,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:49,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:47:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277614466] [2023-08-29 19:47:49,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:49,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:47:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:49,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:47:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:47:49,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-29 19:47:49,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:49,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:49,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-29 19:47:49,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:49,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,618 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,618 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,618 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,618 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,618 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,618 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-29 19:47:49,618 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:47:49,619 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:47:49,619 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,649 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,649 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,649 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,650 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,650 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,650 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,653 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 347#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,653 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,653 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,653 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,653 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-29 19:47:49,667 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 92#L731true, 23#L752-4true]) [2023-08-29 19:47:49,667 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event [2023-08-29 19:47:49,667 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-29 19:47:49,667 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-29 19:47:49,668 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is not cut-off event [2023-08-29 19:47:49,668 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), 92#L731true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,668 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,668 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,668 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,668 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,672 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,672 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,672 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,672 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,672 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,677 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,678 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,678 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,678 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,678 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,678 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,678 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,678 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,678 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,678 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,683 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,684 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,684 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 104#L753-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,684 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,684 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,685 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 104#L753-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,685 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,685 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,685 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,685 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,685 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,686 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,686 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,686 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,686 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,686 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,686 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,686 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,686 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,686 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,691 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,691 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,691 INFO L383 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,692 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,692 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,692 INFO L386 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-29 19:47:49,705 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), 92#L731true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,705 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,705 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,705 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,705 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,706 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,707 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,707 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,707 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,707 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,708 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 81#L714-1true, 34#L741true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-29 19:47:49,708 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,708 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,708 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,709 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-29 19:47:49,709 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,709 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,709 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,709 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,710 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,710 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,714 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,714 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,714 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,714 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,714 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,714 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,714 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,714 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,714 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,715 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,715 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,715 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,720 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 110#L741true, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,721 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,721 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,721 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,721 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,721 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 110#L741true, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,721 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,721 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,721 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,721 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,722 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,722 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,722 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,722 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,722 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,722 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,722 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,723 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,723 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,723 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 104#L753-1true, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,724 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,724 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,724 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,724 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,724 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-29 19:47:49,724 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,724 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,725 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,725 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,725 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,725 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,725 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,725 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,725 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,730 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 347#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,730 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,731 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,731 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,731 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,731 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,731 INFO L383 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,732 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,732 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,732 INFO L386 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-29 19:47:49,742 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [18#L754-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), 92#L731true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,742 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,742 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,742 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,742 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,744 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 81#L714-1true, 34#L741true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,744 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,744 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,744 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,744 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,745 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,745 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,745 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,745 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,745 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,746 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,746 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,746 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,746 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,746 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,747 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,747 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,747 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,747 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,748 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,748 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,749 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,749 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,749 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,749 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 81#L714-1true, 34#L741true, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32)), 23#L752-4true]) [2023-08-29 19:47:49,749 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,749 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,750 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,750 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,754 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,754 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,754 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,754 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,754 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,755 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,755 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,755 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,755 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,755 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,755 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 110#L741true, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,755 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,756 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,756 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,756 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,756 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 110#L741true, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,756 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,756 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,756 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,756 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,757 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,757 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,757 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,757 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,757 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,761 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 18#L754-1true, 110#L741true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,762 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,762 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,762 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 110#L741true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,762 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,762 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,762 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,762 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,763 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,763 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,763 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,764 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,764 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,764 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 382#true, 145#true, 86#L753-2true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,764 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,764 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,764 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,764 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,765 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,765 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,765 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,765 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,765 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,765 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 104#L753-1true, 145#true, 81#L714-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,765 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,765 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,766 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,766 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,768 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,768 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,768 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,768 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,768 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,769 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,769 INFO L383 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,769 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,769 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,769 INFO L386 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-29 19:47:49,803 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,803 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,803 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,803 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,803 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,806 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 382#true, 145#true, 244#true, 86#L753-2true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,806 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,806 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,806 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,806 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,807 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 145#true, 244#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,807 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,807 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,807 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,807 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [72#writerEXITtrue, 145#true, 104#L753-1true, 387#(= ~r~0 (_ bv0 32)), 81#L714-1true, 34#L741true, 112#readerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,808 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 81#L714-1true, 34#L741true, 112#readerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,808 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,808 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 36#$Ultimate##0true, 34#L741true, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,809 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,809 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,809 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,809 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,809 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,810 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,810 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,810 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,810 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,815 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [110#L741true, 145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,815 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,815 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,815 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [110#L741true, 145#true, 86#L753-2true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,816 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [18#L754-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,816 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,816 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [18#L754-1true, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 106#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,817 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 382#true, 347#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,817 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,817 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,818 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,818 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,818 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,818 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,818 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,822 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 18#L754-1true, 382#true, 145#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,822 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,822 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,823 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 145#true, 86#L753-2true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,823 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,823 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,826 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 36#$Ultimate##0true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 382#true, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,826 INFO L383 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,826 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,826 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,826 INFO L386 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-29 19:47:49,829 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,829 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,829 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,829 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,829 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,832 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 34#L741true, 112#readerEXITtrue, 347#true, 15#writerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-08-29 19:47:49,832 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,832 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,832 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,832 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,837 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 18#L754-1true, 382#true, 145#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,837 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,837 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,837 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,837 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 18#L754-1true, 145#true, 244#true, 13#L744true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,838 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 112#readerEXITtrue, 145#true, 86#L753-2true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,838 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,838 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,839 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 112#readerEXITtrue, 382#true, 145#true, 244#true, 86#L753-2true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,839 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,839 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,839 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,839 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,840 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 36#$Ultimate##0true, 34#L741true, 112#readerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,840 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,840 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,840 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,840 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,844 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [18#L754-1true, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 34#L741true, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,844 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,844 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,844 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,844 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [18#L754-1true, 110#L741true, 145#true, 387#(= ~r~0 (_ bv0 32)), 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,845 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,845 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,845 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,846 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [72#writerEXITtrue, 145#true, 104#L753-1true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,846 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,846 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,846 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,846 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,848 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][78], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,849 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 18#L754-1true, 382#true, 145#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,849 INFO L383 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-29 19:47:49,852 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,852 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,852 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,852 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,852 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,853 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [72#writerEXITtrue, 145#true, 104#L753-1true, 34#L741true, 112#readerEXITtrue, 347#true, 15#writerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,853 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,853 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,853 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,853 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,865 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][86], [34#L741true, 112#readerEXITtrue, 18#L754-1true, 145#true, 244#true, 387#(= ~r~0 (_ bv0 32)), Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,865 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,866 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,866 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,866 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,866 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [34#L741true, 112#readerEXITtrue, 18#L754-1true, 382#true, 145#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 81#L714-1true, Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), 358#(= ~w~0 (_ bv1 32))]) [2023-08-29 19:47:49,866 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,866 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,866 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,866 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,869 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,869 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,870 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,870 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,870 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,870 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [145#true, 86#L753-2true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,870 INFO L383 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,870 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,870 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,870 INFO L386 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 34#L741true, 347#true, 15#writerEXITtrue, 382#true, 244#true, 13#L744true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,873 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [145#true, 86#L753-2true, 34#L741true, 112#readerEXITtrue, 382#true, 347#true, 15#writerEXITtrue, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,873 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,873 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,881 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([377] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork0_~lx~0#1_15| v_~x~0_7) (not (= |v_readerThread1of1ForFork0_~lx~0#1_15| |v_readerThread1of1ForFork0_~ly~0#1_15|))) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, ~x~0=v_~x~0_7} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_15|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_15|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1][77], [18#L754-1true, 145#true, 38#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 112#readerEXITtrue, 15#writerEXITtrue, 347#true, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 358#(= ~w~0 (_ bv1 32)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,881 INFO L383 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,881 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,881 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,881 INFO L386 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-29 19:47:49,883 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([355] L737-->L741: Formula: (and (= v_~r~0_33 (bvadd |v_readerThread1of1ForFork0_~l~0#1_17| (_ bv1 32))) (= |v_readerThread1of1ForFork0_~lx~0#1_13| |v_readerThread1of1ForFork0_~ly~0#1_13|)) InVars {readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} OutVars{readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_13|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_17|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_13|, ~r~0=v_~r~0_33} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][90], [18#L754-1true, 145#true, 34#L741true, 112#readerEXITtrue, 347#true, 15#writerEXITtrue, 382#true, 244#true, Black: 265#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 281#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|)), Black: 277#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork0_~ly~0#1| (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32))), Black: 358#(= ~w~0 (_ bv1 32)), Black: 275#(and (= ~x~0 (_ bv0 32)) (= (_ bv0 32) |readerThread1of1ForFork0_~l~0#1|) (= ~y~0 (_ bv0 32)))]) [2023-08-29 19:47:49,883 INFO L383 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-29 19:47:49,883 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 19:47:49,883 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 19:47:49,883 INFO L386 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-29 19:47:49,901 INFO L130 PetriNetUnfolder]: 4255/7273 cut-off events. [2023-08-29 19:47:49,901 INFO L131 PetriNetUnfolder]: For 5397/5563 co-relation queries the response was YES. [2023-08-29 19:47:49,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18247 conditions, 7273 events. 4255/7273 cut-off events. For 5397/5563 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 54927 event pairs, 1047 based on Foata normal form. 208/6879 useless extension candidates. Maximal degree in co-relation 18237. Up to 3282 conditions per place. [2023-08-29 19:47:49,924 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 72 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2023-08-29 19:47:49,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 576 flow [2023-08-29 19:47:49,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:47:49,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:47:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-29 19:47:49,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5680851063829787 [2023-08-29 19:47:49,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-29 19:47:49,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-29 19:47:49,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:49,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-29 19:47:49,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:49,928 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-29 19:47:49,929 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-29 19:47:49,929 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 255 flow. Second operand 4 states and 534 transitions. [2023-08-29 19:47:49,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 576 flow [2023-08-29 19:47:49,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 118 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:49,938 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 330 flow [2023-08-29 19:47:49,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2023-08-29 19:47:49,939 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-08-29 19:47:49,939 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 330 flow [2023-08-29 19:47:49,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:49,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:49,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:49,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:50,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:50,146 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:50,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1105522908, now seen corresponding path program 1 times [2023-08-29 19:47:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599011473] [2023-08-29 19:47:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:50,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:50,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:50,147 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:50,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-29 19:47:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:50,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:47:50,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:50,237 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-29 19:47:50,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:50,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:50,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599011473] [2023-08-29 19:47:50,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599011473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:50,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:50,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:47:50,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700148930] [2023-08-29 19:47:50,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:50,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:47:50,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:50,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:47:50,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:47:50,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-29 19:47:50,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:50,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:50,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-29 19:47:50,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:51,313 INFO L130 PetriNetUnfolder]: 9862/16710 cut-off events. [2023-08-29 19:47:51,313 INFO L131 PetriNetUnfolder]: For 13038/13051 co-relation queries the response was YES. [2023-08-29 19:47:51,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43164 conditions, 16710 events. 9862/16710 cut-off events. For 13038/13051 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 134048 event pairs, 2689 based on Foata normal form. 431/16830 useless extension candidates. Maximal degree in co-relation 43153. Up to 5750 conditions per place. [2023-08-29 19:47:51,436 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 203 selfloop transitions, 25 changer transitions 0/236 dead transitions. [2023-08-29 19:47:51,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 236 transitions, 1397 flow [2023-08-29 19:47:51,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:47:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:47:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1140 transitions. [2023-08-29 19:47:51,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390070921985816 [2023-08-29 19:47:51,443 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1140 transitions. [2023-08-29 19:47:51,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1140 transitions. [2023-08-29 19:47:51,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:51,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1140 transitions. [2023-08-29 19:47:51,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.66666666666667) internal successors, (1140), 9 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:51,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:51,448 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:51,448 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 330 flow. Second operand 9 states and 1140 transitions. [2023-08-29 19:47:51,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 236 transitions, 1397 flow [2023-08-29 19:47:51,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 236 transitions, 1381 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:51,486 INFO L231 Difference]: Finished difference. Result has 78 places, 87 transitions, 438 flow [2023-08-29 19:47:51,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=438, PETRI_PLACES=78, PETRI_TRANSITIONS=87} [2023-08-29 19:47:51,486 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 6 predicate places. [2023-08-29 19:47:51,487 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 87 transitions, 438 flow [2023-08-29 19:47:51,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:51,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:51,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:51,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:51,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:51,694 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:51,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1564325353, now seen corresponding path program 1 times [2023-08-29 19:47:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734037671] [2023-08-29 19:47:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:51,696 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:51,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-08-29 19:47:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:51,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:47:51,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:51,771 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-29 19:47:51,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:51,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:51,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734037671] [2023-08-29 19:47:51,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734037671] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:51,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:51,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876105404] [2023-08-29 19:47:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:51,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:51,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:51,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:51,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-29 19:47:51,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 87 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:51,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:51,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-29 19:47:51,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:53,475 INFO L130 PetriNetUnfolder]: 18080/30253 cut-off events. [2023-08-29 19:47:53,475 INFO L131 PetriNetUnfolder]: For 42702/43459 co-relation queries the response was YES. [2023-08-29 19:47:53,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86582 conditions, 30253 events. 18080/30253 cut-off events. For 42702/43459 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 257892 event pairs, 3644 based on Foata normal form. 1459/31316 useless extension candidates. Maximal degree in co-relation 86566. Up to 14855 conditions per place. [2023-08-29 19:47:53,606 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 207 selfloop transitions, 87 changer transitions 0/306 dead transitions. [2023-08-29 19:47:53,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 306 transitions, 2115 flow [2023-08-29 19:47:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 19:47:53,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 19:47:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1133 transitions. [2023-08-29 19:47:53,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356973995271868 [2023-08-29 19:47:53,609 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1133 transitions. [2023-08-29 19:47:53,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1133 transitions. [2023-08-29 19:47:53,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:53,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1133 transitions. [2023-08-29 19:47:53,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.88888888888889) internal successors, (1133), 9 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:53,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:53,613 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:53,614 INFO L175 Difference]: Start difference. First operand has 78 places, 87 transitions, 438 flow. Second operand 9 states and 1133 transitions. [2023-08-29 19:47:53,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 306 transitions, 2115 flow [2023-08-29 19:47:53,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 306 transitions, 2047 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-29 19:47:53,821 INFO L231 Difference]: Finished difference. Result has 89 places, 161 transitions, 1099 flow [2023-08-29 19:47:53,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1099, PETRI_PLACES=89, PETRI_TRANSITIONS=161} [2023-08-29 19:47:53,822 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 17 predicate places. [2023-08-29 19:47:53,822 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 161 transitions, 1099 flow [2023-08-29 19:47:53,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:53,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:53,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:53,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:54,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:54,029 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:54,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1149898361, now seen corresponding path program 1 times [2023-08-29 19:47:54,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417888158] [2023-08-29 19:47:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:54,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:54,031 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:54,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-08-29 19:47:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:54,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:47:54,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:54,127 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-29 19:47:54,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:54,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417888158] [2023-08-29 19:47:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417888158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:54,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559912754] [2023-08-29 19:47:54,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:54,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:54,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:54,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:54,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 235 [2023-08-29 19:47:54,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 161 transitions, 1099 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:54,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:54,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 235 [2023-08-29 19:47:54,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:54,689 INFO L130 PetriNetUnfolder]: 3699/7175 cut-off events. [2023-08-29 19:47:54,690 INFO L131 PetriNetUnfolder]: For 9924/10341 co-relation queries the response was YES. [2023-08-29 19:47:54,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21551 conditions, 7175 events. 3699/7175 cut-off events. For 9924/10341 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 59631 event pairs, 954 based on Foata normal form. 445/7308 useless extension candidates. Maximal degree in co-relation 21531. Up to 3095 conditions per place. [2023-08-29 19:47:54,718 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 94 selfloop transitions, 13 changer transitions 0/191 dead transitions. [2023-08-29 19:47:54,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 191 transitions, 1300 flow [2023-08-29 19:47:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 19:47:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 19:47:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-29 19:47:54,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5574468085106383 [2023-08-29 19:47:54,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-29 19:47:54,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-29 19:47:54,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:54,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-29 19:47:54,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:54,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:54,723 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:54,723 INFO L175 Difference]: Start difference. First operand has 89 places, 161 transitions, 1099 flow. Second operand 5 states and 655 transitions. [2023-08-29 19:47:54,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 191 transitions, 1300 flow [2023-08-29 19:47:54,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 191 transitions, 1294 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:54,744 INFO L231 Difference]: Finished difference. Result has 94 places, 135 transitions, 887 flow [2023-08-29 19:47:54,744 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=887, PETRI_PLACES=94, PETRI_TRANSITIONS=135} [2023-08-29 19:47:54,744 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2023-08-29 19:47:54,744 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 135 transitions, 887 flow [2023-08-29 19:47:54,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:54,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:54,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:54,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:54,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:54,945 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:54,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1563377597, now seen corresponding path program 1 times [2023-08-29 19:47:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289455426] [2023-08-29 19:47:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:54,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:54,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:54,947 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:54,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-08-29 19:47:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:55,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:47:55,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:55,053 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-29 19:47:55,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:55,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289455426] [2023-08-29 19:47:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289455426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857565142] [2023-08-29 19:47:55,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:55,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:47:55,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:55,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:47:55,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:47:55,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-29 19:47:55,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 135 transitions, 887 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:55,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:55,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-29 19:47:55,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:55,845 INFO L130 PetriNetUnfolder]: 5271/9753 cut-off events. [2023-08-29 19:47:55,845 INFO L131 PetriNetUnfolder]: For 15616/15870 co-relation queries the response was YES. [2023-08-29 19:47:55,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31333 conditions, 9753 events. 5271/9753 cut-off events. For 15616/15870 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 76738 event pairs, 2424 based on Foata normal form. 148/9807 useless extension candidates. Maximal degree in co-relation 31311. Up to 7696 conditions per place. [2023-08-29 19:47:55,876 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 138 selfloop transitions, 55 changer transitions 0/205 dead transitions. [2023-08-29 19:47:55,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 205 transitions, 1675 flow [2023-08-29 19:47:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 19:47:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 19:47:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 966 transitions. [2023-08-29 19:47:55,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138297872340426 [2023-08-29 19:47:55,878 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 966 transitions. [2023-08-29 19:47:55,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 966 transitions. [2023-08-29 19:47:55,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:55,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 966 transitions. [2023-08-29 19:47:55,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:55,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:55,882 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:55,882 INFO L175 Difference]: Start difference. First operand has 94 places, 135 transitions, 887 flow. Second operand 8 states and 966 transitions. [2023-08-29 19:47:55,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 205 transitions, 1675 flow [2023-08-29 19:47:55,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 205 transitions, 1622 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-29 19:47:55,913 INFO L231 Difference]: Finished difference. Result has 103 places, 146 transitions, 1103 flow [2023-08-29 19:47:55,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1103, PETRI_PLACES=103, PETRI_TRANSITIONS=146} [2023-08-29 19:47:55,914 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 31 predicate places. [2023-08-29 19:47:55,914 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 146 transitions, 1103 flow [2023-08-29 19:47:55,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:55,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:55,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:55,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:56,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:56,121 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:56,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1168617517, now seen corresponding path program 1 times [2023-08-29 19:47:56,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:56,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728008745] [2023-08-29 19:47:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:56,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:56,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:56,123 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:56,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-08-29 19:47:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:56,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:47:56,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:56,206 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-29 19:47:56,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:56,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:56,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728008745] [2023-08-29 19:47:56,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728008745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:56,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:56,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:47:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974326597] [2023-08-29 19:47:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:56,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:47:56,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:56,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:47:56,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:47:56,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-29 19:47:56,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 146 transitions, 1103 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 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-29 19:47:56,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:56,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-29 19:47:56,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:57,048 INFO L130 PetriNetUnfolder]: 5338/9873 cut-off events. [2023-08-29 19:47:57,048 INFO L131 PetriNetUnfolder]: For 18434/18686 co-relation queries the response was YES. [2023-08-29 19:47:57,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32077 conditions, 9873 events. 5338/9873 cut-off events. For 18434/18686 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 78007 event pairs, 1775 based on Foata normal form. 248/9998 useless extension candidates. Maximal degree in co-relation 32050. Up to 5735 conditions per place. [2023-08-29 19:47:57,092 INFO L137 encePairwiseOnDemand]: 226/235 looper letters, 171 selfloop transitions, 80 changer transitions 0/266 dead transitions. [2023-08-29 19:47:57,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 266 transitions, 2213 flow [2023-08-29 19:47:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:47:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:47:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 882 transitions. [2023-08-29 19:47:57,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361702127659574 [2023-08-29 19:47:57,095 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 882 transitions. [2023-08-29 19:47:57,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 882 transitions. [2023-08-29 19:47:57,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:57,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 882 transitions. [2023-08-29 19:47:57,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:57,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:57,098 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:57,098 INFO L175 Difference]: Start difference. First operand has 103 places, 146 transitions, 1103 flow. Second operand 7 states and 882 transitions. [2023-08-29 19:47:57,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 266 transitions, 2213 flow [2023-08-29 19:47:57,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 266 transitions, 2205 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:57,141 INFO L231 Difference]: Finished difference. Result has 113 places, 177 transitions, 1571 flow [2023-08-29 19:47:57,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1571, PETRI_PLACES=113, PETRI_TRANSITIONS=177} [2023-08-29 19:47:57,142 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 41 predicate places. [2023-08-29 19:47:57,142 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 177 transitions, 1571 flow [2023-08-29 19:47:57,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 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-29 19:47:57,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:57,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:57,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:57,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:57,349 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:57,349 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:57,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1086748892, now seen corresponding path program 1 times [2023-08-29 19:47:57,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:57,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020295581] [2023-08-29 19:47:57,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:57,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:57,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:57,350 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:57,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-08-29 19:47:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:47:57,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:47:57,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:47:57,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-29 19:47:57,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:47:57,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:47:57,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020295581] [2023-08-29 19:47:57,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020295581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:47:57,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:47:57,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:47:57,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960789627] [2023-08-29 19:47:57,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:47:57,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:47:57,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:47:57,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:47:57,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:47:57,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-29 19:47:57,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 177 transitions, 1571 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:57,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:47:57,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-29 19:47:57,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:47:58,620 INFO L130 PetriNetUnfolder]: 5871/11044 cut-off events. [2023-08-29 19:47:58,620 INFO L131 PetriNetUnfolder]: For 23972/24268 co-relation queries the response was YES. [2023-08-29 19:47:58,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37557 conditions, 11044 events. 5871/11044 cut-off events. For 23972/24268 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 89541 event pairs, 1856 based on Foata normal form. 266/11237 useless extension candidates. Maximal degree in co-relation 37525. Up to 5055 conditions per place. [2023-08-29 19:47:58,682 INFO L137 encePairwiseOnDemand]: 227/235 looper letters, 225 selfloop transitions, 65 changer transitions 0/304 dead transitions. [2023-08-29 19:47:58,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 304 transitions, 2784 flow [2023-08-29 19:47:58,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 19:47:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 19:47:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1011 transitions. [2023-08-29 19:47:58,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5377659574468086 [2023-08-29 19:47:58,685 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1011 transitions. [2023-08-29 19:47:58,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1011 transitions. [2023-08-29 19:47:58,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:47:58,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1011 transitions. [2023-08-29 19:47:58,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.375) internal successors, (1011), 8 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:58,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:58,689 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 235.0) internal successors, (2115), 9 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:58,689 INFO L175 Difference]: Start difference. First operand has 113 places, 177 transitions, 1571 flow. Second operand 8 states and 1011 transitions. [2023-08-29 19:47:58,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 304 transitions, 2784 flow [2023-08-29 19:47:58,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 304 transitions, 2784 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:47:58,743 INFO L231 Difference]: Finished difference. Result has 124 places, 186 transitions, 1801 flow [2023-08-29 19:47:58,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=1571, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1801, PETRI_PLACES=124, PETRI_TRANSITIONS=186} [2023-08-29 19:47:58,743 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 52 predicate places. [2023-08-29 19:47:58,743 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 186 transitions, 1801 flow [2023-08-29 19:47:58,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:47:58,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:47:58,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:58,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:58,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:58,951 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-29 19:47:58,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:47:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1529828392, now seen corresponding path program 1 times [2023-08-29 19:47:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:47:58,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779082747] [2023-08-29 19:47:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:47:58,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:58,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:47:58,953 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 19:47:58,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-08-29 19:47:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:47:59,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:47:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:47:59,106 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 19:47:59,107 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:47:59,107 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-08-29 19:47:59,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-08-29 19:47:59,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-08-29 19:47:59,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-08-29 19:47:59,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-08-29 19:47:59,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-08-29 19:47:59,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-08-29 19:47:59,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-08-29 19:47:59,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-08-29 19:47:59,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-08-29 19:47:59,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-08-29 19:47:59,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-08-29 19:47:59,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-08-29 19:47:59,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-08-29 19:47:59,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-08-29 19:47:59,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-08-29 19:47:59,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-08-29 19:47:59,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-08-29 19:47:59,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 19:47:59,319 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:47:59,323 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:47:59,323 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:47:59,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:47:59 BasicIcfg [2023-08-29 19:47:59,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:47:59,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:47:59,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:47:59,352 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:47:59,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:47:32" (3/4) ... [2023-08-29 19:47:59,354 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:47:59,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:47:59,354 INFO L158 Benchmark]: Toolchain (without parser) took 28122.11ms. Allocated memory was 92.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 69.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 720.6MB. Max. memory is 16.1GB. [2023-08-29 19:47:59,354 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:47:59,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.33ms. Allocated memory is still 92.3MB. Free memory was 69.2MB in the beginning and 48.5MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-29 19:47:59,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.46ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 71.3MB in the end (delta: -23.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 19:47:59,355 INFO L158 Benchmark]: Boogie Preprocessor took 43.81ms. Allocated memory is still 92.3MB. Free memory was 71.3MB in the beginning and 69.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:47:59,355 INFO L158 Benchmark]: RCFGBuilder took 442.27ms. Allocated memory is still 92.3MB. Free memory was 69.7MB in the beginning and 48.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-29 19:47:59,356 INFO L158 Benchmark]: TraceAbstraction took 27277.22ms. Allocated memory was 92.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 47.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 699.9MB. Max. memory is 16.1GB. [2023-08-29 19:47:59,356 INFO L158 Benchmark]: Witness Printer took 2.24ms. Allocated memory is still 2.2GB. Free memory is still 1.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:47:59,357 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 49.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.33ms. Allocated memory is still 92.3MB. Free memory was 69.2MB in the beginning and 48.5MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.46ms. Allocated memory is still 92.3MB. Free memory was 48.3MB in the beginning and 71.3MB in the end (delta: -23.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.81ms. Allocated memory is still 92.3MB. Free memory was 71.3MB in the beginning and 69.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 442.27ms. Allocated memory is still 92.3MB. Free memory was 69.7MB in the beginning and 48.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27277.22ms. Allocated memory was 92.3MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 47.9MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 699.9MB. Max. memory is 16.1GB. * Witness Printer took 2.24ms. Allocated memory is still 2.2GB. Free memory is still 1.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 134 PlacesBefore, 72 PlacesAfterwards, 123 TransitionsBefore, 61 TransitionsAfterwards, 3246 CoEnabledTransitionPairs, 5 FixpointIterations, 39 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 104 TotalNumberOfCompositions, 11920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4744, independent: 4503, independent conditional: 0, independent unconditional: 4503, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1607, independent: 1570, independent conditional: 0, independent unconditional: 1570, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4744, independent: 2933, independent conditional: 0, independent unconditional: 2933, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 1607, unknown conditional: 0, unknown unconditional: 1607] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 338, Positive conditional cache size: 0, Positive unconditional cache size: 338, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 738]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 738. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-1, r=0, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=0, r=0, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L724] 2 int l; [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=1, r=1, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=2, r=1, t1={7:0}, t2={-2147483637:0}, t3={15:0}, t4={11:0}, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l [L745] 2 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 24 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1983 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1422 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3168 IncrementalHoareTripleChecker+Invalid, 3285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 116 mSDtfsCounter, 3168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1801occurred in iteration=18, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 154 ConstructedInterpolants, 14 QuantifiedInterpolants, 866 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1554 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 19:47:59,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample