./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:58:22,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:58:22,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:58:22,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:58:22,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:58:22,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:58:22,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:58:22,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:58:22,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:58:22,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:58:22,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:58:22,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:58:22,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:58:22,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:58:22,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:58:22,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:58:22,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:58:22,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:58:22,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:58:22,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:58:22,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:58:22,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:58:22,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:58:22,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:58:22,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:58:22,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:58:22,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:58:22,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:58:22,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:58:22,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:58:22,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:58:22,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:58:22,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:58:22,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:58:22,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:58:22,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:58:22,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:58:22,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:58:22,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:58:22,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:58:22,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:58:22,106 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 02:58:22,122 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:58:22,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:58:22,122 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:58:22,123 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:58:22,123 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:58:22,124 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:58:22,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:58:22,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:58:22,125 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:58:22,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:58:22,125 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:58:22,126 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:58:22,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:58:22,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:58:22,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:58:22,127 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:58:22,127 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:58:22,127 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:58:22,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:58:22,128 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:58:22,128 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:58:22,128 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:58:22,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:58:22,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:58:22,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:58:22,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:22,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:58:22,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:58:22,130 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 02:58:22,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 02:58:22,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:58:22,131 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:58:22,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:58:22,132 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:58:22,132 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:58:22,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:58:22,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:58:22,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:58:22,452 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:58:22,453 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:58:22,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-30 02:58:23,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:58:23,695 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:58:23,696 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-30 02:58:23,706 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5766abdde/275f24e7a10d4f278e03df03c6ec1fb0/FLAGaa5cbf29b [2023-08-30 02:58:23,718 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5766abdde/275f24e7a10d4f278e03df03c6ec1fb0 [2023-08-30 02:58:23,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:58:23,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:58:23,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:23,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:58:23,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:58:23,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:23" (1/1) ... [2023-08-30 02:58:23,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abc472a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:23, skipping insertion in model container [2023-08-30 02:58:23,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:58:23" (1/1) ... [2023-08-30 02:58:23,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:58:23,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:58:23,905 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-wmm/mix053_tso.oepc.i[949,962] [2023-08-30 02:58:24,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:24,090 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:58:24,098 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-wmm/mix053_tso.oepc.i[949,962] [2023-08-30 02:58:24,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:58:24,166 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:24,166 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:58:24,171 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:58:24,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24 WrapperNode [2023-08-30 02:58:24,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:58:24,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:24,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:58:24,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:58:24,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,214 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-30 02:58:24,215 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:58:24,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:58:24,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:58:24,216 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:58:24,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,228 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,248 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:58:24,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:58:24,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:58:24,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:58:24,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (1/1) ... [2023-08-30 02:58:24,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:58:24,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:58:24,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:58:24,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:58:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 02:58:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:58:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:58:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:58:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:58:24,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:58:24,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:58:24,322 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:58:24,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:58:24,322 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:58:24,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:58:24,322 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:58:24,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:58:24,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 02:58:24,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:58:24,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:58:24,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:58:24,324 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:58:24,438 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:58:24,439 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:58:24,701 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:58:24,928 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:58:24,928 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:58:24,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:24 BoogieIcfgContainer [2023-08-30 02:58:24,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:58:24,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:58:24,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:58:24,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:58:24,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:58:23" (1/3) ... [2023-08-30 02:58:24,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8a9855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:24, skipping insertion in model container [2023-08-30 02:58:24,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:58:24" (2/3) ... [2023-08-30 02:58:24,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8a9855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:58:24, skipping insertion in model container [2023-08-30 02:58:24,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:24" (3/3) ... [2023-08-30 02:58:24,935 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-08-30 02:58:24,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:58:24,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:58:24,955 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:58:25,040 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:58:25,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2023-08-30 02:58:25,144 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-30 02:58:25,149 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:25,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:58:25,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2023-08-30 02:58:25,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2023-08-30 02:58:25,167 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:58:25,178 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-30 02:58:25,180 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-30 02:58:25,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2023-08-30 02:58:25,200 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-30 02:58:25,200 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:25,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:58:25,214 INFO L119 LiptonReduction]: Number of co-enabled transitions 3210 [2023-08-30 02:58:28,991 INFO L134 LiptonReduction]: Checked pairs total: 8872 [2023-08-30 02:58:28,992 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-30 02:58:29,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:58:29,014 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;@569a21b8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:58:29,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:58:29,016 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:58:29,016 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:29,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:29,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:58:29,018 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:29,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash 587, now seen corresponding path program 1 times [2023-08-30 02:58:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:29,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493176902] [2023-08-30 02:58:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:29,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:29,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493176902] [2023-08-30 02:58:29,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493176902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:29,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:29,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:58:29,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800087269] [2023-08-30 02:58:29,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:29,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:58:29,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:29,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:58:29,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:58:29,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2023-08-30 02:58:29,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:29,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:29,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2023-08-30 02:58:29,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:29,865 INFO L130 PetriNetUnfolder]: 5761/7905 cut-off events. [2023-08-30 02:58:29,865 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-30 02:58:29,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15895 conditions, 7905 events. 5761/7905 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 40931 event pairs, 5761 based on Foata normal form. 240/6908 useless extension candidates. Maximal degree in co-relation 15883. Up to 7833 conditions per place. [2023-08-30 02:58:29,900 INFO L137 encePairwiseOnDemand]: 265/274 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-30 02:58:29,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-30 02:58:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:58:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:58:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-30 02:58:29,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218978102189781 [2023-08-30 02:58:29,914 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-30 02:58:29,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-30 02:58:29,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:29,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-30 02:58:29,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:29,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:29,924 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:29,925 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 286 transitions. [2023-08-30 02:58:29,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-30 02:58:29,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:29,930 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-30 02:58:29,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-30 02:58:29,934 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-30 02:58:29,934 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-30 02:58:29,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:29,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:29,935 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:29,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 02:58:29,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:29,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1574103746, now seen corresponding path program 1 times [2023-08-30 02:58:29,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:29,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821117506] [2023-08-30 02:58:29,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:29,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:30,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:30,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821117506] [2023-08-30 02:58:30,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821117506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:30,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:30,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:58:30,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629723140] [2023-08-30 02:58:30,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:30,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:58:30,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:58:30,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:58:30,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 274 [2023-08-30 02:58:30,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 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-30 02:58:30,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:30,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 274 [2023-08-30 02:58:30,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:30,755 INFO L130 PetriNetUnfolder]: 4535/6433 cut-off events. [2023-08-30 02:58:30,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:58:30,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12762 conditions, 6433 events. 4535/6433 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 34196 event pairs, 1241 based on Foata normal form. 0/5829 useless extension candidates. Maximal degree in co-relation 12759. Up to 4903 conditions per place. [2023-08-30 02:58:30,781 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 37 selfloop transitions, 2 changer transitions 4/47 dead transitions. [2023-08-30 02:58:30,781 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 190 flow [2023-08-30 02:58:30,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:58:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:58:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-30 02:58:30,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060827250608273 [2023-08-30 02:58:30,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-30 02:58:30,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-30 02:58:30,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:30,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-30 02:58:30,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:30,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:30,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:30,789 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 416 transitions. [2023-08-30 02:58:30,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 190 flow [2023-08-30 02:58:30,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:58:30,790 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-30 02:58:30,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-30 02:58:30,791 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-30 02:58:30,791 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-30 02:58:30,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-30 02:58:30,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:30,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:30,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 02:58:30,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:30,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:30,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2073770922, now seen corresponding path program 1 times [2023-08-30 02:58:30,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102133735] [2023-08-30 02:58:30,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:30,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:31,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:31,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102133735] [2023-08-30 02:58:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102133735] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:31,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:31,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678012141] [2023-08-30 02:58:31,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:31,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:31,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:31,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:31,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:31,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2023-08-30 02:58:31,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:31,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:31,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2023-08-30 02:58:31,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:33,366 INFO L130 PetriNetUnfolder]: 11949/16674 cut-off events. [2023-08-30 02:58:33,367 INFO L131 PetriNetUnfolder]: For 830/830 co-relation queries the response was YES. [2023-08-30 02:58:33,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34027 conditions, 16674 events. 11949/16674 cut-off events. For 830/830 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 92790 event pairs, 716 based on Foata normal form. 0/16174 useless extension candidates. Maximal degree in co-relation 34023. Up to 8520 conditions per place. [2023-08-30 02:58:33,416 INFO L137 encePairwiseOnDemand]: 261/274 looper letters, 82 selfloop transitions, 26 changer transitions 0/109 dead transitions. [2023-08-30 02:58:33,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 109 transitions, 466 flow [2023-08-30 02:58:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-30 02:58:33,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470281543274244 [2023-08-30 02:58:33,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-30 02:58:33,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-30 02:58:33,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:33,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-30 02:58:33,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,424 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,424 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 7 states and 902 transitions. [2023-08-30 02:58:33,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 109 transitions, 466 flow [2023-08-30 02:58:33,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 109 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:33,426 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 256 flow [2023-08-30 02:58:33,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=49, PETRI_TRANSITIONS=53} [2023-08-30 02:58:33,427 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-30 02:58:33,427 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 256 flow [2023-08-30 02:58:33,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:33,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:33,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:33,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 02:58:33,428 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:33,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2073770856, now seen corresponding path program 1 times [2023-08-30 02:58:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:33,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653626836] [2023-08-30 02:58:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653626836] [2023-08-30 02:58:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653626836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654347836] [2023-08-30 02:58:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:33,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:33,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:33,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:34,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 274 [2023-08-30 02:58:34,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 53 transitions, 256 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-30 02:58:34,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:34,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 274 [2023-08-30 02:58:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:35,079 INFO L130 PetriNetUnfolder]: 8273/11675 cut-off events. [2023-08-30 02:58:35,079 INFO L131 PetriNetUnfolder]: For 13903/15021 co-relation queries the response was YES. [2023-08-30 02:58:35,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35636 conditions, 11675 events. 8273/11675 cut-off events. For 13903/15021 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 67218 event pairs, 2061 based on Foata normal form. 1061/12195 useless extension candidates. Maximal degree in co-relation 35628. Up to 10261 conditions per place. [2023-08-30 02:58:35,132 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 50 selfloop transitions, 4 changer transitions 9/72 dead transitions. [2023-08-30 02:58:35,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 452 flow [2023-08-30 02:58:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:35,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions. [2023-08-30 02:58:35,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142335766423358 [2023-08-30 02:58:35,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions. [2023-08-30 02:58:35,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions. [2023-08-30 02:58:35,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:35,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions. [2023-08-30 02:58:35,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:35,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:35,140 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:35,140 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 256 flow. Second operand 6 states and 681 transitions. [2023-08-30 02:58:35,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 452 flow [2023-08-30 02:58:35,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 02:58:35,198 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 183 flow [2023-08-30 02:58:35,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-30 02:58:35,199 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-30 02:58:35,200 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 183 flow [2023-08-30 02:58:35,200 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-30 02:58:35,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:35,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:35,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 02:58:35,201 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:35,201 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:35,201 INFO L85 PathProgramCache]: Analyzing trace with hash 727216577, now seen corresponding path program 1 times [2023-08-30 02:58:35,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631290801] [2023-08-30 02:58:35,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:35,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:35,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:35,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631290801] [2023-08-30 02:58:35,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631290801] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:35,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:35,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:35,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853066130] [2023-08-30 02:58:35,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:35,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:58:35,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:35,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:58:35,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:58:35,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-30 02:58:35,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:35,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:35,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-30 02:58:35,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:37,080 INFO L130 PetriNetUnfolder]: 10219/15120 cut-off events. [2023-08-30 02:58:37,081 INFO L131 PetriNetUnfolder]: For 13273/14662 co-relation queries the response was YES. [2023-08-30 02:58:37,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44541 conditions, 15120 events. 10219/15120 cut-off events. For 13273/14662 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 98020 event pairs, 2933 based on Foata normal form. 616/15063 useless extension candidates. Maximal degree in co-relation 44532. Up to 10661 conditions per place. [2023-08-30 02:58:37,142 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 51 selfloop transitions, 5 changer transitions 26/90 dead transitions. [2023-08-30 02:58:37,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 538 flow [2023-08-30 02:58:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-30 02:58:37,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48613138686131385 [2023-08-30 02:58:37,144 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-30 02:58:37,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-30 02:58:37,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:37,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-30 02:58:37,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,148 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,148 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 183 flow. Second operand 5 states and 666 transitions. [2023-08-30 02:58:37,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 538 flow [2023-08-30 02:58:37,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 528 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:58:37,158 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 229 flow [2023-08-30 02:58:37,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-30 02:58:37,159 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-30 02:58:37,159 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 229 flow [2023-08-30 02:58:37,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:37,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:37,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 02:58:37,160 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:37,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2129466899, now seen corresponding path program 1 times [2023-08-30 02:58:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994260545] [2023-08-30 02:58:37,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994260545] [2023-08-30 02:58:37,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994260545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:37,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:37,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:37,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639086482] [2023-08-30 02:58:37,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:37,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:37,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:37,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:37,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-30 02:58:37,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:37,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:37,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-30 02:58:37,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:38,613 INFO L130 PetriNetUnfolder]: 9372/13784 cut-off events. [2023-08-30 02:58:38,613 INFO L131 PetriNetUnfolder]: For 22808/23632 co-relation queries the response was YES. [2023-08-30 02:58:38,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45121 conditions, 13784 events. 9372/13784 cut-off events. For 22808/23632 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 85829 event pairs, 1751 based on Foata normal form. 429/13745 useless extension candidates. Maximal degree in co-relation 45109. Up to 9265 conditions per place. [2023-08-30 02:58:38,660 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 59 selfloop transitions, 14 changer transitions 24/105 dead transitions. [2023-08-30 02:58:38,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 679 flow [2023-08-30 02:58:38,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:58:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:58:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions. [2023-08-30 02:58:38,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781021897810219 [2023-08-30 02:58:38,662 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 786 transitions. [2023-08-30 02:58:38,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 786 transitions. [2023-08-30 02:58:38,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:38,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 786 transitions. [2023-08-30 02:58:38,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,666 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,666 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 229 flow. Second operand 6 states and 786 transitions. [2023-08-30 02:58:38,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 679 flow [2023-08-30 02:58:38,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 671 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:38,713 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 328 flow [2023-08-30 02:58:38,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-08-30 02:58:38,715 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-30 02:58:38,715 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 328 flow [2023-08-30 02:58:38,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.33333333333333) internal successors, (728), 6 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:38,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:38,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:38,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 02:58:38,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:38,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1065236943, now seen corresponding path program 2 times [2023-08-30 02:58:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476128947] [2023-08-30 02:58:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:39,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:39,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476128947] [2023-08-30 02:58:39,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476128947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:39,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:39,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:39,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31957969] [2023-08-30 02:58:39,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:39,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:39,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:39,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:39,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:39,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-30 02:58:39,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 328 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:39,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:39,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-30 02:58:39,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:40,334 INFO L130 PetriNetUnfolder]: 9103/13370 cut-off events. [2023-08-30 02:58:40,335 INFO L131 PetriNetUnfolder]: For 34404/35700 co-relation queries the response was YES. [2023-08-30 02:58:40,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47749 conditions, 13370 events. 9103/13370 cut-off events. For 34404/35700 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 82108 event pairs, 1723 based on Foata normal form. 530/13421 useless extension candidates. Maximal degree in co-relation 47735. Up to 9252 conditions per place. [2023-08-30 02:58:40,389 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 63 selfloop transitions, 20 changer transitions 30/121 dead transitions. [2023-08-30 02:58:40,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 121 transitions, 902 flow [2023-08-30 02:58:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-30 02:58:40,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796663190823775 [2023-08-30 02:58:40,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-30 02:58:40,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-30 02:58:40,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:40,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-30 02:58:40,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,396 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,396 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 328 flow. Second operand 7 states and 920 transitions. [2023-08-30 02:58:40,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 121 transitions, 902 flow [2023-08-30 02:58:40,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 877 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:40,580 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 465 flow [2023-08-30 02:58:40,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=465, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2023-08-30 02:58:40,580 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-08-30 02:58:40,596 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 465 flow [2023-08-30 02:58:40,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:40,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:40,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:40,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 02:58:40,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:40,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1068848381, now seen corresponding path program 1 times [2023-08-30 02:58:40,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:40,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933724705] [2023-08-30 02:58:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:40,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:41,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:41,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933724705] [2023-08-30 02:58:41,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933724705] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:41,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:41,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:41,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424288782] [2023-08-30 02:58:41,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:41,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:41,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:41,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:41,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:41,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-30 02:58:41,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:41,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:41,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-30 02:58:41,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:42,565 INFO L130 PetriNetUnfolder]: 9599/14197 cut-off events. [2023-08-30 02:58:42,565 INFO L131 PetriNetUnfolder]: For 57070/58634 co-relation queries the response was YES. [2023-08-30 02:58:42,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54542 conditions, 14197 events. 9599/14197 cut-off events. For 57070/58634 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 89564 event pairs, 1945 based on Foata normal form. 678/14455 useless extension candidates. Maximal degree in co-relation 54525. Up to 9507 conditions per place. [2023-08-30 02:58:42,655 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 86 selfloop transitions, 13 changer transitions 21/128 dead transitions. [2023-08-30 02:58:42,655 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 128 transitions, 1057 flow [2023-08-30 02:58:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2023-08-30 02:58:42,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48279457768508866 [2023-08-30 02:58:42,658 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2023-08-30 02:58:42,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2023-08-30 02:58:42,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:42,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2023-08-30 02:58:42,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:42,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:42,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:42,663 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 465 flow. Second operand 7 states and 926 transitions. [2023-08-30 02:58:42,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 128 transitions, 1057 flow [2023-08-30 02:58:42,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 1029 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:42,820 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 567 flow [2023-08-30 02:58:42,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2023-08-30 02:58:42,820 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-08-30 02:58:42,820 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 567 flow [2023-08-30 02:58:42,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:42,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:42,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:42,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 02:58:42,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:42,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:42,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1227493371, now seen corresponding path program 1 times [2023-08-30 02:58:42,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:42,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241833327] [2023-08-30 02:58:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241833327] [2023-08-30 02:58:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241833327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:58:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040221752] [2023-08-30 02:58:43,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:43,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:58:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:43,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:58:43,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:58:43,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 274 [2023-08-30 02:58:43,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 567 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:43,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:43,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 274 [2023-08-30 02:58:43,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:46,208 INFO L130 PetriNetUnfolder]: 15046/21241 cut-off events. [2023-08-30 02:58:46,208 INFO L131 PetriNetUnfolder]: For 84344/84344 co-relation queries the response was YES. [2023-08-30 02:58:46,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86599 conditions, 21241 events. 15046/21241 cut-off events. For 84344/84344 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 122175 event pairs, 3602 based on Foata normal form. 392/21633 useless extension candidates. Maximal degree in co-relation 86581. Up to 12737 conditions per place. [2023-08-30 02:58:46,311 INFO L137 encePairwiseOnDemand]: 261/274 looper letters, 74 selfloop transitions, 52 changer transitions 61/187 dead transitions. [2023-08-30 02:58:46,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 187 transitions, 1721 flow [2023-08-30 02:58:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 02:58:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 02:58:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1235 transitions. [2023-08-30 02:58:46,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45072992700729925 [2023-08-30 02:58:46,314 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1235 transitions. [2023-08-30 02:58:46,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1235 transitions. [2023-08-30 02:58:46,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:46,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1235 transitions. [2023-08-30 02:58:46,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.5) internal successors, (1235), 10 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:46,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 274.0) internal successors, (3014), 11 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:46,320 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 274.0) internal successors, (3014), 11 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:46,320 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 567 flow. Second operand 10 states and 1235 transitions. [2023-08-30 02:58:46,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 187 transitions, 1721 flow [2023-08-30 02:58:46,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 187 transitions, 1664 flow, removed 25 selfloop flow, removed 1 redundant places. [2023-08-30 02:58:46,625 INFO L231 Difference]: Finished difference. Result has 87 places, 89 transitions, 980 flow [2023-08-30 02:58:46,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=980, PETRI_PLACES=87, PETRI_TRANSITIONS=89} [2023-08-30 02:58:46,625 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-30 02:58:46,626 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 980 flow [2023-08-30 02:58:46,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:46,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:46,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:46,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 02:58:46,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:46,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1871988717, now seen corresponding path program 2 times [2023-08-30 02:58:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673151454] [2023-08-30 02:58:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:47,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:47,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673151454] [2023-08-30 02:58:47,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673151454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:47,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:47,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197105523] [2023-08-30 02:58:47,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:47,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:47,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:47,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:47,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-30 02:58:47,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 980 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:47,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:47,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-30 02:58:47,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:48,667 INFO L130 PetriNetUnfolder]: 12016/17085 cut-off events. [2023-08-30 02:58:48,667 INFO L131 PetriNetUnfolder]: For 148872/150411 co-relation queries the response was YES. [2023-08-30 02:58:48,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91619 conditions, 17085 events. 12016/17085 cut-off events. For 148872/150411 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 100238 event pairs, 1821 based on Foata normal form. 983/17703 useless extension candidates. Maximal degree in co-relation 91592. Up to 9788 conditions per place. [2023-08-30 02:58:48,853 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 101 selfloop transitions, 33 changer transitions 24/173 dead transitions. [2023-08-30 02:58:48,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 173 transitions, 2038 flow [2023-08-30 02:58:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:58:48,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:58:48,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 916 transitions. [2023-08-30 02:58:48,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47758081334723673 [2023-08-30 02:58:48,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 916 transitions. [2023-08-30 02:58:48,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 916 transitions. [2023-08-30 02:58:48,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:48,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 916 transitions. [2023-08-30 02:58:48,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:48,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:48,864 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:48,864 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 980 flow. Second operand 7 states and 916 transitions. [2023-08-30 02:58:48,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 173 transitions, 2038 flow [2023-08-30 02:58:49,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 173 transitions, 1937 flow, removed 50 selfloop flow, removed 7 redundant places. [2023-08-30 02:58:49,263 INFO L231 Difference]: Finished difference. Result has 76 places, 102 transitions, 1254 flow [2023-08-30 02:58:49,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1254, PETRI_PLACES=76, PETRI_TRANSITIONS=102} [2023-08-30 02:58:49,263 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2023-08-30 02:58:49,264 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 1254 flow [2023-08-30 02:58:49,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:49,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:49,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:49,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 02:58:49,264 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:49,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:49,265 INFO L85 PathProgramCache]: Analyzing trace with hash 602317750, now seen corresponding path program 1 times [2023-08-30 02:58:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:49,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140096587] [2023-08-30 02:58:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:49,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:49,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:49,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140096587] [2023-08-30 02:58:49,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140096587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:49,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:49,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746962848] [2023-08-30 02:58:49,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:49,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:49,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:49,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-30 02:58:49,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 102 transitions, 1254 flow. Second operand has 7 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:49,751 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:49,751 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-30 02:58:49,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:51,647 INFO L130 PetriNetUnfolder]: 12752/18231 cut-off events. [2023-08-30 02:58:51,647 INFO L131 PetriNetUnfolder]: For 163046/164811 co-relation queries the response was YES. [2023-08-30 02:58:51,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102695 conditions, 18231 events. 12752/18231 cut-off events. For 163046/164811 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 109267 event pairs, 2068 based on Foata normal form. 768/18478 useless extension candidates. Maximal degree in co-relation 102671. Up to 11687 conditions per place. [2023-08-30 02:58:51,831 INFO L137 encePairwiseOnDemand]: 265/274 looper letters, 143 selfloop transitions, 74 changer transitions 19/251 dead transitions. [2023-08-30 02:58:51,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 251 transitions, 3199 flow [2023-08-30 02:58:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 02:58:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 02:58:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1448 transitions. [2023-08-30 02:58:51,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804246848042468 [2023-08-30 02:58:51,836 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1448 transitions. [2023-08-30 02:58:51,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1448 transitions. [2023-08-30 02:58:51,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:51,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1448 transitions. [2023-08-30 02:58:51,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 131.63636363636363) internal successors, (1448), 11 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:51,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 274.0) internal successors, (3288), 12 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:51,845 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 274.0) internal successors, (3288), 12 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:51,845 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 1254 flow. Second operand 11 states and 1448 transitions. [2023-08-30 02:58:51,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 251 transitions, 3199 flow [2023-08-30 02:58:52,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 251 transitions, 2907 flow, removed 116 selfloop flow, removed 3 redundant places. [2023-08-30 02:58:52,561 INFO L231 Difference]: Finished difference. Result has 89 places, 152 transitions, 2123 flow [2023-08-30 02:58:52,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2123, PETRI_PLACES=89, PETRI_TRANSITIONS=152} [2023-08-30 02:58:52,561 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2023-08-30 02:58:52,561 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 152 transitions, 2123 flow [2023-08-30 02:58:52,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.28571428571429) internal successors, (863), 7 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:52,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:52,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:52,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 02:58:52,562 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:52,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:52,563 INFO L85 PathProgramCache]: Analyzing trace with hash 663091390, now seen corresponding path program 2 times [2023-08-30 02:58:52,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:52,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191098637] [2023-08-30 02:58:52,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:52,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:53,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191098637] [2023-08-30 02:58:53,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191098637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:53,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:53,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:58:53,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112662717] [2023-08-30 02:58:53,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:53,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:58:53,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:53,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:58:53,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:58:53,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 274 [2023-08-30 02:58:53,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 152 transitions, 2123 flow. Second operand has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:53,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:53,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 274 [2023-08-30 02:58:53,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:56,133 INFO L130 PetriNetUnfolder]: 19822/27803 cut-off events. [2023-08-30 02:58:56,135 INFO L131 PetriNetUnfolder]: For 222134/222134 co-relation queries the response was YES. [2023-08-30 02:58:56,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146304 conditions, 27803 events. 19822/27803 cut-off events. For 222134/222134 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 165284 event pairs, 3080 based on Foata normal form. 736/28539 useless extension candidates. Maximal degree in co-relation 146274. Up to 11631 conditions per place. [2023-08-30 02:58:56,425 INFO L137 encePairwiseOnDemand]: 264/274 looper letters, 135 selfloop transitions, 83 changer transitions 56/274 dead transitions. [2023-08-30 02:58:56,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 274 transitions, 4006 flow [2023-08-30 02:58:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:58:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:58:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-30 02:58:56,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562043795620438 [2023-08-30 02:58:56,444 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-30 02:58:56,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-30 02:58:56,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:56,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-30 02:58:56,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:56,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:56,451 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:56,451 INFO L175 Difference]: Start difference. First operand has 89 places, 152 transitions, 2123 flow. Second operand 8 states and 1000 transitions. [2023-08-30 02:58:56,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 274 transitions, 4006 flow [2023-08-30 02:58:57,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 274 transitions, 3885 flow, removed 60 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:57,153 INFO L231 Difference]: Finished difference. Result has 99 places, 176 transitions, 2774 flow [2023-08-30 02:58:57,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2052, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2774, PETRI_PLACES=99, PETRI_TRANSITIONS=176} [2023-08-30 02:58:57,153 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2023-08-30 02:58:57,153 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 176 transitions, 2774 flow [2023-08-30 02:58:57,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:57,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:57,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:57,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 02:58:57,154 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:57,155 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1851695294, now seen corresponding path program 1 times [2023-08-30 02:58:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411866814] [2023-08-30 02:58:57,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:58:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:58:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:58:57,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:58:57,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411866814] [2023-08-30 02:58:57,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411866814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:58:57,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:58:57,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:58:57,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448619305] [2023-08-30 02:58:57,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:58:57,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:58:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:58:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:58:57,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:58:57,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-30 02:58:57,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 176 transitions, 2774 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:57,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:58:57,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-30 02:58:57,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:58:58,421 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L797-->L804: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse0))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_66 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$w_buff1_used~0_66 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_35 (ite .cse3 v_~y$w_buff1~0_34 v_~y~0_62))) (= v_~y$w_buff0_used~0_79 (ite .cse4 0 v_~y$w_buff0_used~0_80)) (= v_~y$r_buff0_thd3~0_24 (ite .cse2 0 v_~y$r_buff0_thd3~0_25))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][108], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 5#L817true, Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 141#L804true, 160#true, 127#L752true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,423 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,423 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,424 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,424 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,424 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L817-->L824: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_24) v_~y$r_buff0_thd4~0_23) (= v_~y$w_buff1_used~0_84 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_85)) (= v_~y~0_69 (ite .cse2 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_38 v_~y~0_70))) (= (ite .cse2 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd4~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_24, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_23, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][149], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, 94#L824true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, 127#L752true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,424 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,424 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,425 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,425 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:58:58,528 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L797-->L804: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse0))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_66 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$w_buff1_used~0_66 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_35 (ite .cse3 v_~y$w_buff1~0_34 v_~y~0_62))) (= v_~y$w_buff0_used~0_79 (ite .cse4 0 v_~y$w_buff0_used~0_80)) (= v_~y$r_buff0_thd3~0_24 (ite .cse2 0 v_~y$r_buff0_thd3~0_25))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][88], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 336#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 141#L804true, 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,528 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,528 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,529 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,529 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,529 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L817-->L824: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_24) v_~y$r_buff0_thd4~0_23) (= v_~y$w_buff1_used~0_84 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_85)) (= v_~y~0_69 (ite .cse2 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_38 v_~y~0_70))) (= (ite .cse2 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd4~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_24, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_23, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][222], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, 94#L824true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 336#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,529 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,529 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,529 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,529 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,530 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][87], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 50#L774true, Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 336#true, Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,530 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,530 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,530 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,530 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,531 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([519] L852-->L859: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_76 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_171 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_82 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_172 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_145 256) 0)) .cse4))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_15| 0)) (= (ite .cse0 0 v_~y$w_buff0_used~0_172) v_~y$w_buff0_used~0_171) (= v_~y$r_buff0_thd0~0_81 (ite .cse1 0 v_~y$r_buff0_thd0~0_82)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_145) v_~y$w_buff1_used~0_144) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_81 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_144 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_76) v_~y$r_buff1_thd0~0_75) (= v_~y~0_119 (ite .cse0 v_~y$w_buff0~0_97 (ite .cse2 v_~y$w_buff1~0_82 v_~y~0_120)))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_172, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_82, ~y$w_buff0~0=v_~y$w_buff0~0_97, ~y~0=v_~y~0_120, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_145, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_171, ~y$w_buff1~0=v_~y$w_buff1~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, ~y$w_buff0~0=v_~y$w_buff0~0_97, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_15|, ~y~0=v_~y~0_119, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_144, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][218], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), 47#L767true, Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 336#true, Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 125#L859true, Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,531 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,531 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,531 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,531 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,560 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][109], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 50#L774true, Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 5#L817true, Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, 127#L752true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,561 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-08-30 02:58:58,561 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 02:58:58,561 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 02:58:58,561 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 02:58:58,580 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L797-->L804: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse0))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_66 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$w_buff1_used~0_66 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_35 (ite .cse3 v_~y$w_buff1~0_34 v_~y~0_62))) (= v_~y$w_buff0_used~0_79 (ite .cse4 0 v_~y$w_buff0_used~0_80)) (= v_~y$r_buff0_thd3~0_24 (ite .cse2 0 v_~y$r_buff0_thd3~0_25))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][223], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 5#L817true, Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 141#L804true, 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,580 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,580 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,580 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,581 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,581 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L817-->L824: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_24) v_~y$r_buff0_thd4~0_23) (= v_~y$w_buff1_used~0_84 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_85)) (= v_~y~0_69 (ite .cse2 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_38 v_~y~0_70))) (= (ite .cse2 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd4~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_24, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_23, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][282], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, 94#L824true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,581 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,581 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,581 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,581 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,582 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][224], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 50#L774true, Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 324#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 5#L817true, Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:58:58,582 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,582 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,582 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:58,582 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:58:59,633 INFO L130 PetriNetUnfolder]: 12230/17931 cut-off events. [2023-08-30 02:58:59,634 INFO L131 PetriNetUnfolder]: For 273785/282025 co-relation queries the response was YES. [2023-08-30 02:58:59,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107054 conditions, 17931 events. 12230/17931 cut-off events. For 273785/282025 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 116882 event pairs, 2298 based on Foata normal form. 3638/20846 useless extension candidates. Maximal degree in co-relation 107019. Up to 11711 conditions per place. [2023-08-30 02:58:59,764 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 363 selfloop transitions, 10 changer transitions 30/437 dead transitions. [2023-08-30 02:58:59,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 437 transitions, 8024 flow [2023-08-30 02:58:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:58:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:58:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-30 02:58:59,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48175182481751827 [2023-08-30 02:58:59,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-30 02:58:59,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-30 02:58:59,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:58:59,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-30 02:58:59,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 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-30 02:58:59,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:59,770 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:59,770 INFO L175 Difference]: Start difference. First operand has 99 places, 176 transitions, 2774 flow. Second operand 5 states and 660 transitions. [2023-08-30 02:58:59,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 437 transitions, 8024 flow [2023-08-30 02:58:59,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 437 transitions, 7945 flow, removed 39 selfloop flow, removed 2 redundant places. [2023-08-30 02:58:59,948 INFO L231 Difference]: Finished difference. Result has 98 places, 174 transitions, 2675 flow [2023-08-30 02:58:59,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2675, PETRI_PLACES=98, PETRI_TRANSITIONS=174} [2023-08-30 02:58:59,949 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 46 predicate places. [2023-08-30 02:58:59,949 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 174 transitions, 2675 flow [2023-08-30 02:58:59,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:58:59,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:58:59,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:58:59,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 02:58:59,954 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:58:59,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:58:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash -305095829, now seen corresponding path program 1 times [2023-08-30 02:58:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:58:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358264694] [2023-08-30 02:58:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:58:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358264694] [2023-08-30 02:59:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358264694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:00,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288813879] [2023-08-30 02:59:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:00,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:59:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:00,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:59:00,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:59:00,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-30 02:59:00,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 174 transitions, 2675 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:00,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:00,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-30 02:59:00,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:01,480 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L797-->L804: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse0))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_66 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$w_buff1_used~0_66 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_35 (ite .cse3 v_~y$w_buff1~0_34 v_~y~0_62))) (= v_~y$w_buff0_used~0_79 (ite .cse4 0 v_~y$w_buff0_used~0_80)) (= v_~y$r_buff0_thd3~0_24 (ite .cse2 0 v_~y$r_buff0_thd3~0_25))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][109], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 338#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), Black: 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 352#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 141#L804true, 160#true, 127#L752true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,480 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,481 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,481 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,481 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,481 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L817-->L824: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_24) v_~y$r_buff0_thd4~0_23) (= v_~y$w_buff1_used~0_84 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_85)) (= v_~y~0_69 (ite .cse2 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_38 v_~y~0_70))) (= (ite .cse2 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd4~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_24, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_23, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][149], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, 94#L824true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), P3Thread1of1ForFork1InUse, 225#true, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 338#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), Black: 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 352#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, 127#L752true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,482 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,482 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,482 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,482 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-30 02:59:01,594 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L797-->L804: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse0))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_66 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$w_buff1_used~0_66 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_35 (ite .cse3 v_~y$w_buff1~0_34 v_~y~0_62))) (= v_~y$w_buff0_used~0_79 (ite .cse4 0 v_~y$w_buff0_used~0_80)) (= v_~y$r_buff0_thd3~0_24 (ite .cse2 0 v_~y$r_buff0_thd3~0_25))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][219], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 225#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 338#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), Black: 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 354#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 336#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 141#L804true, 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,594 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,594 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,594 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,594 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,595 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L817-->L824: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_24) v_~y$r_buff0_thd4~0_23) (= v_~y$w_buff1_used~0_84 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_85)) (= v_~y~0_69 (ite .cse2 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_38 v_~y~0_70))) (= (ite .cse2 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd4~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_24, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_23, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][281], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 94#L824true, 225#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 338#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), Black: 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 354#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 336#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,595 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,595 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,595 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,595 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,596 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][220], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 84#P0EXITtrue, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 50#L774true, Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 153#true, Black: 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 225#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 338#(= ~__unbuffered_cnt~0 0), 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), Black: 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 354#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 336#true, Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,596 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,596 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,596 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,596 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,636 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][110], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 50#L774true, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 225#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, Black: 338#(= ~__unbuffered_cnt~0 0), Black: 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 352#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, 127#L752true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,637 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-08-30 02:59:01,637 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 02:59:01,637 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 02:59:01,637 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-30 02:59:01,661 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L797-->L804: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_79 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_25 256) 0))) (.cse1 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse3 (and (not (= (mod v_~y$w_buff1_used~0_67 256) 0)) .cse1)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_80 256) 0)) .cse5)) (.cse2 (and .cse5 .cse0))) (and (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_24 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_66 256) 0)))) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$w_buff1_used~0_66 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_67)) (= v_~y~0_61 (ite .cse4 v_~y$w_buff0~0_35 (ite .cse3 v_~y$w_buff1~0_34 v_~y~0_62))) (= v_~y$w_buff0_used~0_79 (ite .cse4 0 v_~y$w_buff0_used~0_80)) (= v_~y$r_buff0_thd3~0_24 (ite .cse2 0 v_~y$r_buff0_thd3~0_25))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_80, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_25, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_24, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_66} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][219], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 84#P0EXITtrue, Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 225#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, Black: 338#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 354#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 141#L804true, 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,662 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,662 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,662 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,662 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,663 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([412] L817-->L824: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_22 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_95 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_96 256) 0))))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_24) v_~y$r_buff0_thd4~0_23) (= v_~y$w_buff1_used~0_84 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_85)) (= v_~y~0_69 (ite .cse2 v_~y$w_buff0~0_39 (ite .cse1 v_~y$w_buff1~0_38 v_~y~0_70))) (= (ite .cse2 0 v_~y$w_buff0_used~0_96) v_~y$w_buff0_used~0_95) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd4~0_23 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_22) v_~y$r_buff1_thd4~0_21)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_24, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_96, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_23, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_95, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][281], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), 47#L767true, Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 84#P0EXITtrue, Black: 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 94#L824true, 225#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, Black: 338#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 354#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,663 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,663 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,663 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,663 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,664 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([397] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_115 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0)))) (let ((.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_116 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff1_used~0_99 256) 0)) .cse2)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff1_used~0_98 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_99)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_98 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)) .cse3)) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= v_~y$w_buff0_used~0_115 (ite .cse4 0 v_~y$w_buff0_used~0_116)) (= (ite .cse4 v_~y$w_buff0~0_51 (ite .cse0 v_~y$w_buff1~0_46 v_~y~0_78)) v_~y~0_77) (= v_~y$r_buff0_thd2~0_21 (ite .cse1 0 v_~y$r_buff0_thd2~0_22))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_99} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_115, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_98} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][220], [Black: 188#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 322#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 250#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 254#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~__unbuffered_p3_EAX~0 0)))), Black: 326#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 50#L774true, Black: 252#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 84#P0EXITtrue, Black: 246#(and (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 153#true, Black: 200#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 320#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 328#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 81#L797true, Black: 318#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 225#true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 15#L852true, P0Thread1of1ForFork2InUse, Black: 338#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork0InUse, 180#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 354#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 341#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 245#(= ~y$r_buff0_thd0~0 0), Black: 282#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 214#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (= ~y~0 1)), Black: 274#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (<= 0 ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 218#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)) (= ~y~0 1)), 287#true, 339#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 168#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 297#(and (= ~y$r_buff0_thd2~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 234#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0)), 5#L817true, Black: 291#(and (= ~y$r_buff0_thd2~0 0) (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y~0 1)), Black: 238#(and (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 292#(and (< 0 (+ (div ~y$r_buff0_thd0~0 256) 1)) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256)))), Black: 290#(and (= ~y$r_buff0_thd2~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff0~0)) (<= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 295#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff0~0)) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1))), 160#true, Black: 184#(and (= ~y$w_buff1~0 0) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~y~0 0) (= ~y$w_buff0~0 0) (< 0 (+ (div ~y$r_buff1_thd0~0 256) 1)))]) [2023-08-30 02:59:01,664 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,664 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,664 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:01,664 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-30 02:59:02,551 INFO L130 PetriNetUnfolder]: 9205/13959 cut-off events. [2023-08-30 02:59:02,552 INFO L131 PetriNetUnfolder]: For 226594/234197 co-relation queries the response was YES. [2023-08-30 02:59:02,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91698 conditions, 13959 events. 9205/13959 cut-off events. For 226594/234197 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 93722 event pairs, 720 based on Foata normal form. 3050/16514 useless extension candidates. Maximal degree in co-relation 91661. Up to 6023 conditions per place. [2023-08-30 02:59:02,862 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 426 selfloop transitions, 19 changer transitions 71/549 dead transitions. [2023-08-30 02:59:02,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 549 transitions, 10057 flow [2023-08-30 02:59:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2023-08-30 02:59:02,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48227320125130346 [2023-08-30 02:59:02,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2023-08-30 02:59:02,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2023-08-30 02:59:02,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:02,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2023-08-30 02:59:02,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:02,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:02,897 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:02,897 INFO L175 Difference]: Start difference. First operand has 98 places, 174 transitions, 2675 flow. Second operand 7 states and 925 transitions. [2023-08-30 02:59:02,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 549 transitions, 10057 flow [2023-08-30 02:59:03,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 549 transitions, 9739 flow, removed 35 selfloop flow, removed 6 redundant places. [2023-08-30 02:59:03,072 INFO L231 Difference]: Finished difference. Result has 101 places, 166 transitions, 2453 flow [2023-08-30 02:59:03,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2453, PETRI_PLACES=101, PETRI_TRANSITIONS=166} [2023-08-30 02:59:03,073 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2023-08-30 02:59:03,073 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 166 transitions, 2453 flow [2023-08-30 02:59:03,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:03,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:03,073 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-30 02:59:03,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 02:59:03,073 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:03,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1254309455, now seen corresponding path program 1 times [2023-08-30 02:59:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498851011] [2023-08-30 02:59:03,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:03,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498851011] [2023-08-30 02:59:03,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498851011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:03,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:03,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962524773] [2023-08-30 02:59:03,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:03,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:59:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:59:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:59:03,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2023-08-30 02:59:03,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 166 transitions, 2453 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:03,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:03,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2023-08-30 02:59:03,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:06,000 INFO L130 PetriNetUnfolder]: 14478/21951 cut-off events. [2023-08-30 02:59:06,000 INFO L131 PetriNetUnfolder]: For 286828/287596 co-relation queries the response was YES. [2023-08-30 02:59:06,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153772 conditions, 21951 events. 14478/21951 cut-off events. For 286828/287596 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 148253 event pairs, 2692 based on Foata normal form. 799/22648 useless extension candidates. Maximal degree in co-relation 153735. Up to 11824 conditions per place. [2023-08-30 02:59:06,199 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 134 selfloop transitions, 14 changer transitions 137/290 dead transitions. [2023-08-30 02:59:06,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 290 transitions, 4706 flow [2023-08-30 02:59:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:59:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:59:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-08-30 02:59:06,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46228710462287104 [2023-08-30 02:59:06,201 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-08-30 02:59:06,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-08-30 02:59:06,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:06,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-08-30 02:59:06,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:06,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:06,205 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:06,206 INFO L175 Difference]: Start difference. First operand has 101 places, 166 transitions, 2453 flow. Second operand 6 states and 760 transitions. [2023-08-30 02:59:06,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 290 transitions, 4706 flow [2023-08-30 02:59:08,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 290 transitions, 4606 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-30 02:59:08,410 INFO L231 Difference]: Finished difference. Result has 107 places, 115 transitions, 1709 flow [2023-08-30 02:59:08,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=2403, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1709, PETRI_PLACES=107, PETRI_TRANSITIONS=115} [2023-08-30 02:59:08,411 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 55 predicate places. [2023-08-30 02:59:08,411 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 1709 flow [2023-08-30 02:59:08,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:08,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:08,412 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] [2023-08-30 02:59:08,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 02:59:08,412 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:08,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:08,413 INFO L85 PathProgramCache]: Analyzing trace with hash 238594536, now seen corresponding path program 1 times [2023-08-30 02:59:08,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:08,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069462240] [2023-08-30 02:59:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:08,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:08,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:08,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069462240] [2023-08-30 02:59:08,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069462240] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:08,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:08,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:59:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003700284] [2023-08-30 02:59:08,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:08,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:08,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:08,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:08,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:08,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-30 02:59:08,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 1709 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:08,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:08,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-30 02:59:08,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:09,566 INFO L130 PetriNetUnfolder]: 4036/6747 cut-off events. [2023-08-30 02:59:09,566 INFO L131 PetriNetUnfolder]: For 101277/103124 co-relation queries the response was YES. [2023-08-30 02:59:09,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43098 conditions, 6747 events. 4036/6747 cut-off events. For 101277/103124 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 46560 event pairs, 363 based on Foata normal form. 1136/7682 useless extension candidates. Maximal degree in co-relation 43057. Up to 2557 conditions per place. [2023-08-30 02:59:09,603 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 204 selfloop transitions, 18 changer transitions 60/303 dead transitions. [2023-08-30 02:59:09,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 303 transitions, 5261 flow [2023-08-30 02:59:09,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2023-08-30 02:59:09,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48279457768508866 [2023-08-30 02:59:09,606 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2023-08-30 02:59:09,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2023-08-30 02:59:09,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:09,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2023-08-30 02:59:09,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:09,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:09,609 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:09,610 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 1709 flow. Second operand 7 states and 926 transitions. [2023-08-30 02:59:09,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 303 transitions, 5261 flow [2023-08-30 02:59:09,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 4977 flow, removed 111 selfloop flow, removed 9 redundant places. [2023-08-30 02:59:09,834 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 1530 flow [2023-08-30 02:59:09,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1530, PETRI_PLACES=101, PETRI_TRANSITIONS=111} [2023-08-30 02:59:09,835 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2023-08-30 02:59:09,835 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 1530 flow [2023-08-30 02:59:09,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:09,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:09,836 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, 1] [2023-08-30 02:59:09,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 02:59:09,836 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:09,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2041197205, now seen corresponding path program 1 times [2023-08-30 02:59:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:09,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721670734] [2023-08-30 02:59:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:09,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:10,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721670734] [2023-08-30 02:59:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721670734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:10,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:59:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401312908] [2023-08-30 02:59:10,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:59:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:59:10,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:59:10,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-30 02:59:10,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 1530 flow. Second operand has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:10,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:10,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-30 02:59:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:11,161 INFO L130 PetriNetUnfolder]: 3807/6408 cut-off events. [2023-08-30 02:59:11,162 INFO L131 PetriNetUnfolder]: For 75704/77033 co-relation queries the response was YES. [2023-08-30 02:59:11,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41974 conditions, 6408 events. 3807/6408 cut-off events. For 75704/77033 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 44700 event pairs, 329 based on Foata normal form. 498/6718 useless extension candidates. Maximal degree in co-relation 41936. Up to 2313 conditions per place. [2023-08-30 02:59:11,185 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 172 selfloop transitions, 23 changer transitions 72/283 dead transitions. [2023-08-30 02:59:11,185 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 283 transitions, 4644 flow [2023-08-30 02:59:11,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 02:59:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 02:59:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1165 transitions. [2023-08-30 02:59:11,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724249797242498 [2023-08-30 02:59:11,187 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1165 transitions. [2023-08-30 02:59:11,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1165 transitions. [2023-08-30 02:59:11,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:11,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1165 transitions. [2023-08-30 02:59:11,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.44444444444446) internal successors, (1165), 9 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:11,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 274.0) internal successors, (2740), 10 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:11,191 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 274.0) internal successors, (2740), 10 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:11,191 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 1530 flow. Second operand 9 states and 1165 transitions. [2023-08-30 02:59:11,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 283 transitions, 4644 flow [2023-08-30 02:59:11,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 283 transitions, 4295 flow, removed 153 selfloop flow, removed 5 redundant places. [2023-08-30 02:59:11,527 INFO L231 Difference]: Finished difference. Result has 107 places, 97 transitions, 1224 flow [2023-08-30 02:59:11,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=1352, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1224, PETRI_PLACES=107, PETRI_TRANSITIONS=97} [2023-08-30 02:59:11,527 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 55 predicate places. [2023-08-30 02:59:11,527 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 97 transitions, 1224 flow [2023-08-30 02:59:11,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:11,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:11,528 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, 1, 1, 1, 1, 1] [2023-08-30 02:59:11,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 02:59:11,528 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:11,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash -464627310, now seen corresponding path program 1 times [2023-08-30 02:59:11,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:11,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128565115] [2023-08-30 02:59:11,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:11,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:11,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:11,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128565115] [2023-08-30 02:59:11,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128565115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:11,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:11,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:59:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979094150] [2023-08-30 02:59:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:11,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:12,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 274 [2023-08-30 02:59:12,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 97 transitions, 1224 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:12,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:12,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 274 [2023-08-30 02:59:12,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:12,538 INFO L130 PetriNetUnfolder]: 2505/4053 cut-off events. [2023-08-30 02:59:12,538 INFO L131 PetriNetUnfolder]: For 38418/38532 co-relation queries the response was YES. [2023-08-30 02:59:12,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27131 conditions, 4053 events. 2505/4053 cut-off events. For 38418/38532 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22942 event pairs, 297 based on Foata normal form. 89/4127 useless extension candidates. Maximal degree in co-relation 27092. Up to 2280 conditions per place. [2023-08-30 02:59:12,558 INFO L137 encePairwiseOnDemand]: 263/274 looper letters, 89 selfloop transitions, 12 changer transitions 114/219 dead transitions. [2023-08-30 02:59:12,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 219 transitions, 3078 flow [2023-08-30 02:59:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-30 02:59:12,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44577685088633995 [2023-08-30 02:59:12,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-30 02:59:12,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-30 02:59:12,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:12,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-30 02:59:12,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:12,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:12,564 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:12,564 INFO L175 Difference]: Start difference. First operand has 107 places, 97 transitions, 1224 flow. Second operand 7 states and 855 transitions. [2023-08-30 02:59:12,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 219 transitions, 3078 flow [2023-08-30 02:59:12,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 219 transitions, 2447 flow, removed 189 selfloop flow, removed 20 redundant places. [2023-08-30 02:59:12,743 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 908 flow [2023-08-30 02:59:12,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=908, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2023-08-30 02:59:12,743 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2023-08-30 02:59:12,743 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 908 flow [2023-08-30 02:59:12,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:12,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:12,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, 1, 1, 1, 1, 1] [2023-08-30 02:59:12,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 02:59:12,744 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:12,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1673893204, now seen corresponding path program 2 times [2023-08-30 02:59:12,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:12,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783564146] [2023-08-30 02:59:12,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:12,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:12,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783564146] [2023-08-30 02:59:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783564146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370566838] [2023-08-30 02:59:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:12,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:59:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:59:12,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:59:12,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-30 02:59:12,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 908 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:12,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:12,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-30 02:59:12,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:13,139 INFO L130 PetriNetUnfolder]: 1194/2008 cut-off events. [2023-08-30 02:59:13,139 INFO L131 PetriNetUnfolder]: For 9611/9669 co-relation queries the response was YES. [2023-08-30 02:59:13,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 2008 events. 1194/2008 cut-off events. For 9611/9669 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10932 event pairs, 304 based on Foata normal form. 36/2031 useless extension candidates. Maximal degree in co-relation 10713. Up to 841 conditions per place. [2023-08-30 02:59:13,145 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 50 selfloop transitions, 1 changer transitions 94/149 dead transitions. [2023-08-30 02:59:13,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 149 transitions, 1798 flow [2023-08-30 02:59:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:59:13,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:59:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-30 02:59:13,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47153284671532847 [2023-08-30 02:59:13,148 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-30 02:59:13,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-30 02:59:13,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:13,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-30 02:59:13,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:13,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:13,150 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:13,150 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 908 flow. Second operand 5 states and 646 transitions. [2023-08-30 02:59:13,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 149 transitions, 1798 flow [2023-08-30 02:59:13,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 149 transitions, 1662 flow, removed 18 selfloop flow, removed 10 redundant places. [2023-08-30 02:59:13,174 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 436 flow [2023-08-30 02:59:13,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=436, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2023-08-30 02:59:13,175 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-30 02:59:13,175 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 436 flow [2023-08-30 02:59:13,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:13,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:13,175 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, 1, 1, 1, 1, 1] [2023-08-30 02:59:13,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 02:59:13,175 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:13,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1966233204, now seen corresponding path program 3 times [2023-08-30 02:59:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:13,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931405675] [2023-08-30 02:59:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:13,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 02:59:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931405675] [2023-08-30 02:59:14,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931405675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:14,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 02:59:14,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452585561] [2023-08-30 02:59:14,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:14,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 02:59:14,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 02:59:14,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 02:59:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-30 02:59:14,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 274 [2023-08-30 02:59:14,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 436 flow. Second operand has 10 states, 10 states have (on average 118.4) internal successors, (1184), 10 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:14,157 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:14,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 274 [2023-08-30 02:59:14,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:14,446 INFO L130 PetriNetUnfolder]: 679/1157 cut-off events. [2023-08-30 02:59:14,446 INFO L131 PetriNetUnfolder]: For 3796/3802 co-relation queries the response was YES. [2023-08-30 02:59:14,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 1157 events. 679/1157 cut-off events. For 3796/3802 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5259 event pairs, 83 based on Foata normal form. 1/1155 useless extension candidates. Maximal degree in co-relation 5495. Up to 492 conditions per place. [2023-08-30 02:59:14,450 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 68 selfloop transitions, 8 changer transitions 39/118 dead transitions. [2023-08-30 02:59:14,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 118 transitions, 1048 flow [2023-08-30 02:59:14,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:14,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-30 02:59:14,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562043795620438 [2023-08-30 02:59:14,452 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-30 02:59:14,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-30 02:59:14,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:14,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-30 02:59:14,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:14,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:14,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:14,455 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 436 flow. Second operand 7 states and 875 transitions. [2023-08-30 02:59:14,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 118 transitions, 1048 flow [2023-08-30 02:59:14,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 118 transitions, 946 flow, removed 25 selfloop flow, removed 14 redundant places. [2023-08-30 02:59:14,464 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 376 flow [2023-08-30 02:59:14,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=376, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2023-08-30 02:59:14,464 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-30 02:59:14,464 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 376 flow [2023-08-30 02:59:14,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 118.4) internal successors, (1184), 10 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:14,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:14,465 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, 1, 1, 1, 1, 1] [2023-08-30 02:59:14,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 02:59:14,465 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:14,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1330975128, now seen corresponding path program 4 times [2023-08-30 02:59:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 02:59:14,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485001706] [2023-08-30 02:59:14,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 02:59:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:59:14,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:59:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:59:14,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 02:59:14,538 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:59:14,539 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:59:14,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:59:14,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:59:14,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:59:14,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:59:14,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:59:14,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:59:14,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:59:14,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:59:14,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:59:14,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:59:14,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:59:14,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:59:14,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:59:14,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:59:14,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:59:14,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 02:59:14,543 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:14,546 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:59:14,548 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:59:14,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:59:14 BasicIcfg [2023-08-30 02:59:14,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:59:14,622 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:59:14,622 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:59:14,622 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:59:14,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:58:24" (3/4) ... [2023-08-30 02:59:14,624 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:59:14,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:59:14,624 INFO L158 Benchmark]: Toolchain (without parser) took 50904.01ms. Allocated memory was 69.2MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 45.1MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-30 02:59:14,625 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:59:14,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.28ms. Allocated memory is still 69.2MB. Free memory was 45.0MB in the beginning and 38.1MB in the end (delta: 6.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 02:59:14,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 35.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:59:14,625 INFO L158 Benchmark]: Boogie Preprocessor took 36.11ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:59:14,626 INFO L158 Benchmark]: RCFGBuilder took 677.87ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 53.2MB in the end (delta: -19.8MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2023-08-30 02:59:14,626 INFO L158 Benchmark]: TraceAbstraction took 49690.39ms. Allocated memory was 83.9MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 52.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-30 02:59:14,626 INFO L158 Benchmark]: Witness Printer took 2.31ms. Allocated memory is still 5.5GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:59:14,628 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 56.6MB. Free memory was 34.5MB in the beginning and 34.5MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.28ms. Allocated memory is still 69.2MB. Free memory was 45.0MB in the beginning and 38.1MB in the end (delta: 6.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 69.2MB. Free memory was 38.1MB in the beginning and 35.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.11ms. Allocated memory is still 69.2MB. Free memory was 35.5MB in the beginning and 33.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 677.87ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 33.4MB in the beginning and 53.2MB in the end (delta: -19.8MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 49690.39ms. Allocated memory was 83.9MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 52.3MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 2.31ms. Allocated memory is still 5.5GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 1.0MB). 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.8s, 146 PlacesBefore, 52 PlacesAfterwards, 135 TransitionsBefore, 40 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 135 TotalNumberOfCompositions, 8872 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3875, independent: 3654, independent conditional: 0, independent unconditional: 3654, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1632, independent: 1599, independent conditional: 0, independent unconditional: 1599, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3875, independent: 2055, independent conditional: 0, independent unconditional: 2055, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1632, unknown conditional: 0, unknown unconditional: 1632] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 156, Positive conditional cache size: 0, Positive unconditional cache size: 156, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-2, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=1, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 846]: 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: 842]: 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: 844]: 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 9 procedures, 174 locations, 16 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: 49.5s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1602 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1318 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3906 IncrementalHoareTripleChecker+Invalid, 4170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 210 mSDtfsCounter, 3906 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2774occurred in iteration=12, InterpolantAutomatonStates: 132, 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.9s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 4048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-30 02:59:14,653 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-wmm/mix053_tso.oepc.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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 02:59:16,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 02:59:16,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 02:59:16,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 02:59:16,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 02:59:16,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 02:59:16,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 02:59:16,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 02:59:16,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 02:59:16,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 02:59:16,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 02:59:16,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 02:59:16,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 02:59:16,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 02:59:16,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 02:59:17,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 02:59:17,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 02:59:17,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 02:59:17,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 02:59:17,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 02:59:17,010 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 02:59:17,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 02:59:17,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 02:59:17,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 02:59:17,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 02:59:17,019 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 02:59:17,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 02:59:17,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 02:59:17,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 02:59:17,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 02:59:17,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 02:59:17,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 02:59:17,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 02:59:17,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 02:59:17,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 02:59:17,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 02:59:17,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 02:59:17,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 02:59:17,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 02:59:17,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 02:59:17,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 02:59:17,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 02:59:17,053 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 02:59:17,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 02:59:17,054 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 02:59:17,054 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 02:59:17,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 02:59:17,055 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 02:59:17,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 02:59:17,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 02:59:17,056 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 02:59:17,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 02:59:17,056 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 02:59:17,056 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 02:59:17,057 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 02:59:17,058 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 02:59:17,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 02:59:17,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 02:59:17,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 02:59:17,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:59:17,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 02:59:17,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 02:59:17,058 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 02:59:17,058 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 02:59:17,059 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 02:59:17,059 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 02:59:17,059 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 02:59:17,059 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 02:59:17,059 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 02:59:17,059 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 02:59:17,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 02:59:17,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 02:59:17,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 02:59:17,337 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 02:59:17,338 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 02:59:17,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-30 02:59:18,453 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 02:59:18,678 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 02:59:18,679 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-30 02:59:18,687 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baecb30a9/aef43e56c7994fb0b4aca562447a4810/FLAGa4a53a943 [2023-08-30 02:59:18,699 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baecb30a9/aef43e56c7994fb0b4aca562447a4810 [2023-08-30 02:59:18,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 02:59:18,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 02:59:18,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 02:59:18,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 02:59:18,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 02:59:18,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:59:18" (1/1) ... [2023-08-30 02:59:18,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77792001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:18, skipping insertion in model container [2023-08-30 02:59:18,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:59:18" (1/1) ... [2023-08-30 02:59:18,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 02:59:18,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 02:59:18,857 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-wmm/mix053_tso.oepc.i[949,962] [2023-08-30 02:59:19,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:59:19,066 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 02:59:19,075 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-wmm/mix053_tso.oepc.i[949,962] [2023-08-30 02:59:19,120 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 02:59:19,160 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:59:19,160 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 02:59:19,165 INFO L208 MainTranslator]: Completed translation [2023-08-30 02:59:19,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19 WrapperNode [2023-08-30 02:59:19,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 02:59:19,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 02:59:19,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 02:59:19,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 02:59:19,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,241 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-30 02:59:19,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 02:59:19,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 02:59:19,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 02:59:19,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 02:59:19,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,266 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 02:59:19,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 02:59:19,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 02:59:19,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 02:59:19,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (1/1) ... [2023-08-30 02:59:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 02:59:19,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 02:59:19,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 02:59:19,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 02:59:19,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 02:59:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 02:59:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 02:59:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 02:59:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 02:59:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 02:59:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 02:59:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 02:59:19,335 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 02:59:19,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 02:59:19,336 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 02:59:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 02:59:19,336 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 02:59:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 02:59:19,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 02:59:19,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 02:59:19,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 02:59:19,337 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 02:59:19,488 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 02:59:19,489 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 02:59:19,808 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 02:59:19,897 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 02:59:19,897 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 02:59:19,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:59:19 BoogieIcfgContainer [2023-08-30 02:59:19,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 02:59:19,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 02:59:19,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 02:59:19,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 02:59:19,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:59:18" (1/3) ... [2023-08-30 02:59:19,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9fffe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:59:19, skipping insertion in model container [2023-08-30 02:59:19,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:59:19" (2/3) ... [2023-08-30 02:59:19,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9fffe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:59:19, skipping insertion in model container [2023-08-30 02:59:19,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:59:19" (3/3) ... [2023-08-30 02:59:19,904 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-08-30 02:59:19,916 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 02:59:19,916 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-30 02:59:19,916 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 02:59:19,965 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 02:59:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2023-08-30 02:59:20,045 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-30 02:59:20,045 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:20,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:59:20,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2023-08-30 02:59:20,058 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2023-08-30 02:59:20,061 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 02:59:20,080 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-30 02:59:20,085 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-30 02:59:20,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2023-08-30 02:59:20,105 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-30 02:59:20,108 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:20,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-30 02:59:20,112 INFO L119 LiptonReduction]: Number of co-enabled transitions 3210 [2023-08-30 02:59:28,432 INFO L134 LiptonReduction]: Checked pairs total: 9300 [2023-08-30 02:59:28,433 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-30 02:59:28,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 02:59:28,452 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;@32fe68b3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 02:59:28,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-30 02:59:28,454 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 02:59:28,454 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:28,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:28,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 02:59:28,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:28,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:28,462 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-08-30 02:59:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:28,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402416368] [2023-08-30 02:59:28,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:28,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:28,476 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:28,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 02:59:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:28,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 02:59:28,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:28,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:28,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402416368] [2023-08-30 02:59:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402416368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:28,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:28,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 02:59:28,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634214127] [2023-08-30 02:59:28,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 02:59:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:28,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 02:59:28,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 02:59:28,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 274 [2023-08-30 02:59:28,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:28,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:28,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 274 [2023-08-30 02:59:28,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:29,354 INFO L130 PetriNetUnfolder]: 4337/6002 cut-off events. [2023-08-30 02:59:29,354 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-30 02:59:29,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12088 conditions, 6002 events. 4337/6002 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 30351 event pairs, 4337 based on Foata normal form. 0/5149 useless extension candidates. Maximal degree in co-relation 12076. Up to 5929 conditions per place. [2023-08-30 02:59:29,381 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-30 02:59:29,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-30 02:59:29,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 02:59:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 02:59:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 285 transitions. [2023-08-30 02:59:29,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200729927007299 [2023-08-30 02:59:29,393 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 285 transitions. [2023-08-30 02:59:29,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 285 transitions. [2023-08-30 02:59:29,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:29,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 285 transitions. [2023-08-30 02:59:29,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 142.5) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:29,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:29,402 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:29,403 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 285 transitions. [2023-08-30 02:59:29,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-30 02:59:29,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:59:29,408 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-30 02:59:29,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-30 02:59:29,411 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-30 02:59:29,412 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-30 02:59:29,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:29,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:29,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:29,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-30 02:59:29,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:29,623 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:29,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1515871887, now seen corresponding path program 1 times [2023-08-30 02:59:29,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:29,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423523405] [2023-08-30 02:59:29,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:29,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:29,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:29,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:29,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 02:59:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:29,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:59:29,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:29,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:29,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:29,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423523405] [2023-08-30 02:59:29,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423523405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:29,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:29,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 02:59:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860911067] [2023-08-30 02:59:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:29,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:59:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:59:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:59:29,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2023-08-30 02:59:29,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:29,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:29,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2023-08-30 02:59:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:30,474 INFO L130 PetriNetUnfolder]: 3415/5026 cut-off events. [2023-08-30 02:59:30,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 02:59:30,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9851 conditions, 5026 events. 3415/5026 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 28523 event pairs, 649 based on Foata normal form. 0/4626 useless extension candidates. Maximal degree in co-relation 9848. Up to 3703 conditions per place. [2023-08-30 02:59:30,496 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-30 02:59:30,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 174 flow [2023-08-30 02:59:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:59:30,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:59:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-30 02:59:30,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048661800486618 [2023-08-30 02:59:30,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-30 02:59:30,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-30 02:59:30,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:30,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-30 02:59:30,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:30,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:30,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:30,521 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 415 transitions. [2023-08-30 02:59:30,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 174 flow [2023-08-30 02:59:30,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 02:59:30,523 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-30 02:59:30,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-30 02:59:30,524 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-30 02:59:30,524 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-30 02:59:30,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:30,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:30,524 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:30,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:30,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:30,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:30,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash 854685866, now seen corresponding path program 1 times [2023-08-30 02:59:30,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:30,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234855321] [2023-08-30 02:59:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:30,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:30,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:30,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:30,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 02:59:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:30,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:59:30,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:30,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:30,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:30,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234855321] [2023-08-30 02:59:30,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234855321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:30,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:59:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706667312] [2023-08-30 02:59:30,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:30,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:59:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:30,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:59:30,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:59:30,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-30 02:59:30,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:30,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:30,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-30 02:59:30,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:31,392 INFO L130 PetriNetUnfolder]: 2413/3512 cut-off events. [2023-08-30 02:59:31,393 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2023-08-30 02:59:31,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7361 conditions, 3512 events. 2413/3512 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 17994 event pairs, 472 based on Foata normal form. 192/3557 useless extension candidates. Maximal degree in co-relation 7357. Up to 2592 conditions per place. [2023-08-30 02:59:31,439 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 35 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-30 02:59:31,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 284 flow [2023-08-30 02:59:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:59:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:59:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-30 02:59:31,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854014598540146 [2023-08-30 02:59:31,441 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-30 02:59:31,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-30 02:59:31,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:31,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-30 02:59:31,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:31,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:31,445 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:31,445 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 665 transitions. [2023-08-30 02:59:31,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 284 flow [2023-08-30 02:59:31,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:31,447 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-30 02:59:31,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-30 02:59:31,448 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-30 02:59:31,448 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-30 02:59:31,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:31,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:31,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:31,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:31,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:31,656 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:31,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:31,657 INFO L85 PathProgramCache]: Analyzing trace with hash 587731453, now seen corresponding path program 1 times [2023-08-30 02:59:31,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:31,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808703058] [2023-08-30 02:59:31,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:31,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:31,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:31,673 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:31,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 02:59:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:31,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:59:31,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:31,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:31,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:31,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808703058] [2023-08-30 02:59:31,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808703058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:31,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:31,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426612075] [2023-08-30 02:59:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:31,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 02:59:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:31,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 02:59:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 02:59:31,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-30 02:59:31,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:31,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:31,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-30 02:59:31,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:32,094 INFO L130 PetriNetUnfolder]: 1306/2027 cut-off events. [2023-08-30 02:59:32,094 INFO L131 PetriNetUnfolder]: For 782/782 co-relation queries the response was YES. [2023-08-30 02:59:32,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5564 conditions, 2027 events. 1306/2027 cut-off events. For 782/782 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10177 event pairs, 218 based on Foata normal form. 138/2099 useless extension candidates. Maximal degree in co-relation 5557. Up to 896 conditions per place. [2023-08-30 02:59:32,106 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 46 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-30 02:59:32,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 425 flow [2023-08-30 02:59:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:59:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:59:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-08-30 02:59:32,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48661800486618007 [2023-08-30 02:59:32,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-08-30 02:59:32,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-08-30 02:59:32,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:32,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-08-30 02:59:32,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,114 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,114 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 800 transitions. [2023-08-30 02:59:32,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 425 flow [2023-08-30 02:59:32,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:32,122 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-30 02:59:32,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-30 02:59:32,122 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:59:32,123 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-30 02:59:32,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:32,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:32,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:32,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:32,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:32,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 899882748, now seen corresponding path program 1 times [2023-08-30 02:59:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635847874] [2023-08-30 02:59:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:32,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:32,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:32,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:32,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 02:59:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:32,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 02:59:32,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:32,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:32,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:32,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635847874] [2023-08-30 02:59:32,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635847874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:32,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:32,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 02:59:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670096486] [2023-08-30 02:59:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:32,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:32,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-30 02:59:32,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:32,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-30 02:59:32,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:32,892 INFO L130 PetriNetUnfolder]: 748/1208 cut-off events. [2023-08-30 02:59:32,893 INFO L131 PetriNetUnfolder]: For 1257/1257 co-relation queries the response was YES. [2023-08-30 02:59:32,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 1208 events. 748/1208 cut-off events. For 1257/1257 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5572 event pairs, 168 based on Foata normal form. 57/1244 useless extension candidates. Maximal degree in co-relation 3818. Up to 415 conditions per place. [2023-08-30 02:59:32,900 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 55 selfloop transitions, 13 changer transitions 23/95 dead transitions. [2023-08-30 02:59:32,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 586 flow [2023-08-30 02:59:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 02:59:32,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 02:59:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2023-08-30 02:59:32,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486444212721585 [2023-08-30 02:59:32,904 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2023-08-30 02:59:32,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2023-08-30 02:59:32,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:32,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2023-08-30 02:59:32,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.28571428571428) internal successors, (933), 7 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,911 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,911 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 933 transitions. [2023-08-30 02:59:32,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 586 flow [2023-08-30 02:59:32,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 524 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-30 02:59:32,920 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-30 02:59:32,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-30 02:59:32,921 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:59:32,921 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-30 02:59:32,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:32,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:32,922 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-30 02:59:32,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:33,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:33,133 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:33,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 894031473, now seen corresponding path program 1 times [2023-08-30 02:59:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:33,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415621885] [2023-08-30 02:59:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:33,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:33,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:33,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:33,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 02:59:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:33,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 02:59:33,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:33,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:33,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:33,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:33,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415621885] [2023-08-30 02:59:33,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415621885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:33,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:33,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 02:59:33,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707867752] [2023-08-30 02:59:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:33,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 02:59:33,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:33,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 02:59:33,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-30 02:59:33,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-30 02:59:33,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:33,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:33,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-30 02:59:33,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:33,660 INFO L130 PetriNetUnfolder]: 625/996 cut-off events. [2023-08-30 02:59:33,660 INFO L131 PetriNetUnfolder]: For 1004/1004 co-relation queries the response was YES. [2023-08-30 02:59:33,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3027 conditions, 996 events. 625/996 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4417 event pairs, 164 based on Foata normal form. 12/998 useless extension candidates. Maximal degree in co-relation 3017. Up to 400 conditions per place. [2023-08-30 02:59:33,666 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 51 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-08-30 02:59:33,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 530 flow [2023-08-30 02:59:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 02:59:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 02:59:33,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1042 transitions. [2023-08-30 02:59:33,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47536496350364965 [2023-08-30 02:59:33,671 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1042 transitions. [2023-08-30 02:59:33,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1042 transitions. [2023-08-30 02:59:33,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:33,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1042 transitions. [2023-08-30 02:59:33,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.25) internal successors, (1042), 8 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:33,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:33,676 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:33,676 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1042 transitions. [2023-08-30 02:59:33,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 530 flow [2023-08-30 02:59:33,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 468 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-30 02:59:33,683 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-30 02:59:33,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-30 02:59:33,685 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-30 02:59:33,685 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-30 02:59:33,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.71428571428571) internal successors, (859), 7 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:33,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:33,685 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, 1, 1, 1, 1] [2023-08-30 02:59:33,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:33,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:33,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:33,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:33,894 INFO L85 PathProgramCache]: Analyzing trace with hash 292457730, now seen corresponding path program 1 times [2023-08-30 02:59:33,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:33,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087391597] [2023-08-30 02:59:33,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:33,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:33,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:33,895 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:33,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 02:59:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:34,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:59:34,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:34,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:34,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:34,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087391597] [2023-08-30 02:59:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087391597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 02:59:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212255876] [2023-08-30 02:59:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:34,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 02:59:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 02:59:34,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-30 02:59:34,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 274 [2023-08-30 02:59:34,933 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:34,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:34,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 274 [2023-08-30 02:59:34,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:35,213 INFO L130 PetriNetUnfolder]: 615/1000 cut-off events. [2023-08-30 02:59:35,213 INFO L131 PetriNetUnfolder]: For 1418/1418 co-relation queries the response was YES. [2023-08-30 02:59:35,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 1000 events. 615/1000 cut-off events. For 1418/1418 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4832 event pairs, 3 based on Foata normal form. 0/1000 useless extension candidates. Maximal degree in co-relation 2959. Up to 763 conditions per place. [2023-08-30 02:59:35,221 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 53 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-30 02:59:35,222 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 455 flow [2023-08-30 02:59:35,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 02:59:35,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 02:59:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions. [2023-08-30 02:59:35,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099756690997567 [2023-08-30 02:59:35,226 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 674 transitions. [2023-08-30 02:59:35,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions. [2023-08-30 02:59:35,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:35,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions. [2023-08-30 02:59:35,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:35,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:35,231 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:35,231 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 6 states and 674 transitions. [2023-08-30 02:59:35,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 455 flow [2023-08-30 02:59:35,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 366 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-30 02:59:35,234 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 158 flow [2023-08-30 02:59:35,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-30 02:59:35,235 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-30 02:59:35,235 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 158 flow [2023-08-30 02:59:35,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:35,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:35,235 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, 1, 1, 1, 1] [2023-08-30 02:59:35,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:35,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:35,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:35,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:35,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1837251032, now seen corresponding path program 1 times [2023-08-30 02:59:35,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:35,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844483540] [2023-08-30 02:59:35,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 02:59:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:35,446 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:35,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 02:59:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 02:59:35,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 02:59:35,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:35,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:35,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:35,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844483540] [2023-08-30 02:59:35,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844483540] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:35,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:35,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 02:59:35,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764212640] [2023-08-30 02:59:35,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:35,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 02:59:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:35,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 02:59:35,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 02:59:35,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 274 [2023-08-30 02:59:35,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 158 flow. Second operand has 3 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-30 02:59:35,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:35,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 274 [2023-08-30 02:59:35,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:35,726 INFO L130 PetriNetUnfolder]: 1121/1781 cut-off events. [2023-08-30 02:59:35,726 INFO L131 PetriNetUnfolder]: For 1081/1081 co-relation queries the response was YES. [2023-08-30 02:59:35,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4962 conditions, 1781 events. 1121/1781 cut-off events. For 1081/1081 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9190 event pairs, 545 based on Foata normal form. 1/1768 useless extension candidates. Maximal degree in co-relation 4954. Up to 1066 conditions per place. [2023-08-30 02:59:35,732 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 52 selfloop transitions, 2 changer transitions 11/68 dead transitions. [2023-08-30 02:59:35,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 424 flow [2023-08-30 02:59:35,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 02:59:35,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 02:59:35,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-30 02:59:35,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 02:59:35,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-30 02:59:35,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-30 02:59:35,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:35,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-30 02:59:35,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:35,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:35,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:35,736 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 158 flow. Second operand 3 states and 411 transitions. [2023-08-30 02:59:35,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 424 flow [2023-08-30 02:59:35,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 412 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 02:59:35,744 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 159 flow [2023-08-30 02:59:35,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 02:59:35,745 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-30 02:59:35,745 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 159 flow [2023-08-30 02:59:35,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-30 02:59:35,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:35,745 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, 1, 1, 1, 1] [2023-08-30 02:59:35,764 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 (9)] Ended with exit code 0 [2023-08-30 02:59:35,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:35,954 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:35,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash -611813848, now seen corresponding path program 2 times [2023-08-30 02:59:35,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:35,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131158327] [2023-08-30 02:59:35,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 02:59:35,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:35,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:35,957 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:35,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 02:59:36,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:59:36,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:59:36,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:59:36,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:36,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:36,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131158327] [2023-08-30 02:59:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131158327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:59:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284206437] [2023-08-30 02:59:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:36,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:59:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:59:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:59:36,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 274 [2023-08-30 02:59:36,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:36,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:36,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 274 [2023-08-30 02:59:36,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:36,255 INFO L130 PetriNetUnfolder]: 648/1108 cut-off events. [2023-08-30 02:59:36,255 INFO L131 PetriNetUnfolder]: For 944/944 co-relation queries the response was YES. [2023-08-30 02:59:36,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1108 events. 648/1108 cut-off events. For 944/944 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5569 event pairs, 79 based on Foata normal form. 1/1108 useless extension candidates. Maximal degree in co-relation 3287. Up to 685 conditions per place. [2023-08-30 02:59:36,259 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 41 selfloop transitions, 1 changer transitions 31/76 dead transitions. [2023-08-30 02:59:36,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 471 flow [2023-08-30 02:59:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:59:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:59:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-08-30 02:59:36,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48905109489051096 [2023-08-30 02:59:36,261 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-08-30 02:59:36,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-08-30 02:59:36,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:36,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-08-30 02:59:36,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:36,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:36,264 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:36,264 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 159 flow. Second operand 4 states and 536 transitions. [2023-08-30 02:59:36,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 471 flow [2023-08-30 02:59:36,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 463 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:36,268 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 160 flow [2023-08-30 02:59:36,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-30 02:59:36,269 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-30 02:59:36,269 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 160 flow [2023-08-30 02:59:36,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:36,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:36,269 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, 1, 1, 1, 1] [2023-08-30 02:59:36,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:36,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:36,478 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:36,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:36,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1563064124, now seen corresponding path program 3 times [2023-08-30 02:59:36,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:36,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637165670] [2023-08-30 02:59:36,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 02:59:36,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:36,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:36,480 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:36,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 02:59:36,578 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 02:59:36,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:59:36,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 02:59:36,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:36,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:36,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:36,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637165670] [2023-08-30 02:59:36,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637165670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:36,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:36,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 02:59:36,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664599097] [2023-08-30 02:59:36,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:36,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 02:59:36,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:36,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 02:59:36,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-30 02:59:36,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-30 02:59:36,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 160 flow. Second operand has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:36,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:36,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-30 02:59:36,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:37,135 INFO L130 PetriNetUnfolder]: 705/1180 cut-off events. [2023-08-30 02:59:37,136 INFO L131 PetriNetUnfolder]: For 1078/1078 co-relation queries the response was YES. [2023-08-30 02:59:37,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3510 conditions, 1180 events. 705/1180 cut-off events. For 1078/1078 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5521 event pairs, 192 based on Foata normal form. 1/1179 useless extension candidates. Maximal degree in co-relation 3500. Up to 563 conditions per place. [2023-08-30 02:59:37,141 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 61 selfloop transitions, 6 changer transitions 11/81 dead transitions. [2023-08-30 02:59:37,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 514 flow [2023-08-30 02:59:37,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:59:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:59:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-30 02:59:37,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47737226277372263 [2023-08-30 02:59:37,145 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-30 02:59:37,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-30 02:59:37,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:37,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-30 02:59:37,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 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-30 02:59:37,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:37,150 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:37,150 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 160 flow. Second operand 5 states and 654 transitions. [2023-08-30 02:59:37,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 514 flow [2023-08-30 02:59:37,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 510 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:37,156 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 189 flow [2023-08-30 02:59:37,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-30 02:59:37,158 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-30 02:59:37,158 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 189 flow [2023-08-30 02:59:37,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:37,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:37,159 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, 1, 1, 1, 1] [2023-08-30 02:59:37,193 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 (11)] Ended with exit code 0 [2023-08-30 02:59:37,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:37,370 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:37,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 110891504, now seen corresponding path program 4 times [2023-08-30 02:59:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:37,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754333602] [2023-08-30 02:59:37,372 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 02:59:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:37,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:37,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-30 02:59:37,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 02:59:37,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:59:37,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-30 02:59:37,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:37,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:37,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:37,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754333602] [2023-08-30 02:59:37,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754333602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:37,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:37,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 02:59:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162940315] [2023-08-30 02:59:37,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:37,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 02:59:37,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:37,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 02:59:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-30 02:59:38,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-30 02:59:38,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 189 flow. Second operand has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:38,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-30 02:59:38,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:38,275 INFO L130 PetriNetUnfolder]: 733/1222 cut-off events. [2023-08-30 02:59:38,275 INFO L131 PetriNetUnfolder]: For 1524/1524 co-relation queries the response was YES. [2023-08-30 02:59:38,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 1222 events. 733/1222 cut-off events. For 1524/1524 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5657 event pairs, 200 based on Foata normal form. 1/1221 useless extension candidates. Maximal degree in co-relation 4117. Up to 525 conditions per place. [2023-08-30 02:59:38,280 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 59 selfloop transitions, 6 changer transitions 14/82 dead transitions. [2023-08-30 02:59:38,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 545 flow [2023-08-30 02:59:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 02:59:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 02:59:38,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-30 02:59:38,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47737226277372263 [2023-08-30 02:59:38,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-30 02:59:38,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-30 02:59:38,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:38,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-30 02:59:38,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 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-30 02:59:38,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,287 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,287 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 189 flow. Second operand 5 states and 654 transitions. [2023-08-30 02:59:38,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 545 flow [2023-08-30 02:59:38,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:38,294 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 206 flow [2023-08-30 02:59:38,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-30 02:59:38,294 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-30 02:59:38,295 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 206 flow [2023-08-30 02:59:38,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:38,295 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, 1, 1, 1, 1] [2023-08-30 02:59:38,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:38,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:38,507 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:38,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1104484756, now seen corresponding path program 5 times [2023-08-30 02:59:38,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:38,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230875565] [2023-08-30 02:59:38,508 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 02:59:38,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:38,509 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:38,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-30 02:59:38,623 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 02:59:38,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 02:59:38,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 02:59:38,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 02:59:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 02:59:38,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 02:59:38,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 02:59:38,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230875565] [2023-08-30 02:59:38,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1230875565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 02:59:38,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 02:59:38,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 02:59:38,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332955723] [2023-08-30 02:59:38,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 02:59:38,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 02:59:38,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 02:59:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 02:59:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 02:59:38,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 274 [2023-08-30 02:59:38,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 02:59:38,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 274 [2023-08-30 02:59:38,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 02:59:38,856 INFO L130 PetriNetUnfolder]: 1065/1777 cut-off events. [2023-08-30 02:59:38,856 INFO L131 PetriNetUnfolder]: For 2377/2391 co-relation queries the response was YES. [2023-08-30 02:59:38,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6079 conditions, 1777 events. 1065/1777 cut-off events. For 2377/2391 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9200 event pairs, 417 based on Foata normal form. 9/1758 useless extension candidates. Maximal degree in co-relation 6067. Up to 709 conditions per place. [2023-08-30 02:59:38,863 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 34 selfloop transitions, 1 changer transitions 44/82 dead transitions. [2023-08-30 02:59:38,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 571 flow [2023-08-30 02:59:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 02:59:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 02:59:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-30 02:59:38,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854014598540146 [2023-08-30 02:59:38,865 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-30 02:59:38,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-30 02:59:38,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 02:59:38,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-30 02:59:38,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,868 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,868 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 206 flow. Second operand 4 states and 532 transitions. [2023-08-30 02:59:38,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 571 flow [2023-08-30 02:59:38,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 02:59:38,878 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 181 flow [2023-08-30 02:59:38,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2023-08-30 02:59:38,878 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-30 02:59:38,879 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 181 flow [2023-08-30 02:59:38,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 02:59:38,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 02:59:38,879 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, 1, 1, 1, 1] [2023-08-30 02:59:38,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:39,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:39,088 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-30 02:59:39,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 02:59:39,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1405050174, now seen corresponding path program 6 times [2023-08-30 02:59:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 02:59:39,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779901103] [2023-08-30 02:59:39,089 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 02:59:39,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:39,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 02:59:39,090 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 02:59:39,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-30 02:59:39,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 02:59:39,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-30 02:59:39,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 02:59:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 02:59:39,365 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 02:59:39,365 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 02:59:39,366 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-30 02:59:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-30 02:59:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-30 02:59:39,367 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-30 02:59:39,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-30 02:59:39,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-30 02:59:39,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-30 02:59:39,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-30 02:59:39,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-30 02:59:39,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 02:59:39,593 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 02:59:39,597 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 02:59:39,597 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 02:59:39,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:59:39 BasicIcfg [2023-08-30 02:59:39,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 02:59:39,692 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 02:59:39,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 02:59:39,693 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 02:59:39,693 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:59:19" (3/4) ... [2023-08-30 02:59:39,695 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 02:59:39,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 02:59:39,695 INFO L158 Benchmark]: Toolchain (without parser) took 20989.21ms. Allocated memory was 71.3MB in the beginning and 882.9MB in the end (delta: 811.6MB). Free memory was 46.3MB in the beginning and 598.9MB in the end (delta: -552.6MB). Peak memory consumption was 260.9MB. Max. memory is 16.1GB. [2023-08-30 02:59:39,695 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 33.6MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:59:39,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.14ms. Allocated memory is still 71.3MB. Free memory was 46.2MB in the beginning and 38.9MB in the end (delta: 7.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2023-08-30 02:59:39,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.08ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 36.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:59:39,696 INFO L158 Benchmark]: Boogie Preprocessor took 27.57ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 33.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 02:59:39,696 INFO L158 Benchmark]: RCFGBuilder took 628.70ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 33.9MB in the beginning and 44.2MB in the end (delta: -10.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2023-08-30 02:59:39,697 INFO L158 Benchmark]: TraceAbstraction took 19791.86ms. Allocated memory was 86.0MB in the beginning and 882.9MB in the end (delta: 796.9MB). Free memory was 43.6MB in the beginning and 598.9MB in the end (delta: -555.3MB). Peak memory consumption was 239.5MB. Max. memory is 16.1GB. [2023-08-30 02:59:39,697 INFO L158 Benchmark]: Witness Printer took 2.34ms. Allocated memory is still 882.9MB. Free memory is still 598.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 02:59:39,698 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 33.6MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.14ms. Allocated memory is still 71.3MB. Free memory was 46.2MB in the beginning and 38.9MB in the end (delta: 7.3MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.08ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 36.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.57ms. Allocated memory is still 71.3MB. Free memory was 36.2MB in the beginning and 33.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 628.70ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 33.9MB in the beginning and 44.2MB in the end (delta: -10.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19791.86ms. Allocated memory was 86.0MB in the beginning and 882.9MB in the end (delta: 796.9MB). Free memory was 43.6MB in the beginning and 598.9MB in the end (delta: -555.3MB). Peak memory consumption was 239.5MB. Max. memory is 16.1GB. * Witness Printer took 2.34ms. Allocated memory is still 882.9MB. Free memory is still 598.9MB. 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: 8.3s, 147 PlacesBefore, 50 PlacesAfterwards, 136 TransitionsBefore, 37 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 8 FixpointIterations, 49 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 134 TotalNumberOfCompositions, 9300 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4227, independent: 3978, independent conditional: 0, independent unconditional: 3978, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1695, independent: 1654, independent conditional: 0, independent unconditional: 1654, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4227, independent: 2324, independent conditional: 0, independent unconditional: 2324, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 1695, unknown conditional: 0, unknown unconditional: 1695] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-1, t1433={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=0, t1433={11:0}, t1434={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=1, t1433={11:0}, t1434={15:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 pthread_t t1436; [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=2, t1433={11:0}, t1434={15:0}, t1435={7:0}, t1436={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={11:0}, t1434={15:0}, t1435={7:0}, t1436={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 848]: 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: 846]: 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: 842]: 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 9 procedures, 175 locations, 16 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: 19.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2189 IncrementalHoareTripleChecker+Invalid, 2324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 68 mSDtfsCounter, 2189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=5, InterpolantAutomatonStates: 58, 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.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 217 ConstructedInterpolants, 15 QuantifiedInterpolants, 2270 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1901 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-30 02:59:39,715 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