./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 AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:29:58,961 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:29:58,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:29:58,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:29:58,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:29:58,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:29:58,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:29:58,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:29:58,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:29:58,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:29:59,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:29:59,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:29:59,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:29:59,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:29:59,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:29:59,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:29:59,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:29:59,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:29:59,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:29:59,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:29:59,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:29:59,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:29:59,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:29:59,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:29:59,023 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:29:59,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:29:59,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:29:59,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:29:59,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:29:59,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:29:59,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:29:59,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:29:59,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:29:59,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:29:59,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:29:59,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:29:59,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:29:59,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:29:59,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:29:59,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:29:59,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:29:59,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:29:59,055 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:29:59,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:29:59,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:29:59,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:29:59,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:29:59,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:29:59,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:29:59,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:29:59,058 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:29:59,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:29:59,059 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:29:59,059 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:29:59,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:29:59,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:29:59,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:29:59,060 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:29:59,060 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:29:59,060 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:29:59,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:29:59,060 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:29:59,060 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:29:59,061 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:29:59,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:29:59,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:29:59,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:29:59,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:29:59,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:29:59,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:29:59,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:29:59,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:29:59,062 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:29:59,062 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:29:59,062 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:29:59,062 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:29:59,063 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 -> AFTER [2023-08-29 20:29:59,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:29:59,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:29:59,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:29:59,316 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:29:59,316 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:29:59,317 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-29 20:30:00,159 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:30:00,387 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:30:00,388 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-29 20:30:00,399 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca07127e/fe92bfe1ff744e3a96d0696775dbbaa0/FLAG3b5b6de8f [2023-08-29 20:30:00,408 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca07127e/fe92bfe1ff744e3a96d0696775dbbaa0 [2023-08-29 20:30:00,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:30:00,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:30:00,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:00,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:30:00,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:30:00,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55eee78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00, skipping insertion in model container [2023-08-29 20:30:00,421 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:30:00,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:30:00,547 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-29 20:30:00,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:00,713 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:30:00,721 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-29 20:30:00,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:00,808 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:00,809 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:00,813 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:30:00,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00 WrapperNode [2023-08-29 20:30:00,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:00,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:00,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:30:00,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:30:00,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,867 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-08-29 20:30:00,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:00,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:30:00,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:30:00,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:30:00,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,890 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:30:00,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:30:00,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:30:00,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:30:00,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (1/1) ... [2023-08-29 20:30:00,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:00,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:30:00,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:30:00,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:30:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:30:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:30:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:30:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:30:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:30:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:30:00,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:30:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:30:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:30:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:30:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:30:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:30:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:30:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:30:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:30:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:30:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:30:00,947 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:30:01,116 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:30:01,118 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:30:01,379 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:30:01,482 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:30:01,483 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:30:01,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:01 BoogieIcfgContainer [2023-08-29 20:30:01,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:30:01,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:30:01,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:30:01,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:30:01,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:30:00" (1/3) ... [2023-08-29 20:30:01,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12293dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:01, skipping insertion in model container [2023-08-29 20:30:01,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:00" (2/3) ... [2023-08-29 20:30:01,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12293dfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:01, skipping insertion in model container [2023-08-29 20:30:01,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:01" (3/3) ... [2023-08-29 20:30:01,489 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-08-29 20:30:01,499 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:30:01,500 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:30:01,500 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:30:01,541 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:30:01,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2023-08-29 20:30:01,603 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-29 20:30:01,603 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:01,607 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-29 20:30:01,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2023-08-29 20:30:01,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:01,612 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:30:01,631 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:01,633 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:01,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2023-08-29 20:30:01,660 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2023-08-29 20:30:01,662 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:01,664 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-29 20:30:01,666 INFO L119 LiptonReduction]: Number of co-enabled transitions 3210 [2023-08-29 20:30:05,483 INFO L134 LiptonReduction]: Checked pairs total: 8872 [2023-08-29 20:30:05,483 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-29 20:30:05,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:30:05,496 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;@7f2b910b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:30:05,496 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:30:05,497 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:30:05,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:05,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:05,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:30:05,498 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-29 20:30:05,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:05,501 INFO L85 PathProgramCache]: Analyzing trace with hash 587, now seen corresponding path program 1 times [2023-08-29 20:30:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121100444] [2023-08-29 20:30:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:05,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:05,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121100444] [2023-08-29 20:30:05,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121100444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:05,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:05,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:30:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012821324] [2023-08-29 20:30:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:05,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:30:05,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:30:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:30:05,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2023-08-29 20:30:05,602 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-29 20:30:05,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:05,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2023-08-29 20:30:05,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:06,257 INFO L130 PetriNetUnfolder]: 5761/7905 cut-off events. [2023-08-29 20:30:06,257 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-29 20:30:06,280 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-29 20:30:06,306 INFO L137 encePairwiseOnDemand]: 265/274 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:30:06,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-08-29 20:30:06,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:30:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:30:06,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-08-29 20:30:06,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218978102189781 [2023-08-29 20:30:06,316 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-08-29 20:30:06,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-08-29 20:30:06,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:06,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-08-29 20:30:06,320 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-29 20:30:06,323 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-29 20:30:06,323 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-29 20:30:06,324 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 286 transitions. [2023-08-29 20:30:06,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-08-29 20:30:06,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:06,328 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:30:06,330 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-29 20:30:06,332 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:30:06,332 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:30:06,332 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-29 20:30:06,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:06,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:06,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:30:06,333 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-29 20:30:06,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1574103746, now seen corresponding path program 1 times [2023-08-29 20:30:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426801707] [2023-08-29 20:30:06,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:06,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:06,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:06,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426801707] [2023-08-29 20:30:06,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426801707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:06,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:06,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:30:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739833562] [2023-08-29 20:30:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:06,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:06,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:06,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:06,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:06,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 274 [2023-08-29 20:30:06,617 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-29 20:30:06,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:06,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 274 [2023-08-29 20:30:06,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:07,126 INFO L130 PetriNetUnfolder]: 4535/6433 cut-off events. [2023-08-29 20:30:07,127 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:07,133 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-29 20:30:07,149 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 37 selfloop transitions, 2 changer transitions 4/47 dead transitions. [2023-08-29 20:30:07,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 190 flow [2023-08-29 20:30:07,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-08-29 20:30:07,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060827250608273 [2023-08-29 20:30:07,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-08-29 20:30:07,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-08-29 20:30:07,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:07,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-08-29 20:30:07,153 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-29 20:30:07,155 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-29 20:30:07,155 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-29 20:30:07,155 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 416 transitions. [2023-08-29 20:30:07,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 190 flow [2023-08-29 20:30:07,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:30:07,156 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 68 flow [2023-08-29 20:30:07,157 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-29 20:30:07,157 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:30:07,157 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 68 flow [2023-08-29 20:30:07,158 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-29 20:30:07,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:07,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:07,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:30:07,158 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-29 20:30:07,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:07,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2073770922, now seen corresponding path program 1 times [2023-08-29 20:30:07,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:07,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117169920] [2023-08-29 20:30:07,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:07,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:08,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:08,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117169920] [2023-08-29 20:30:08,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117169920] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:08,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:30:08,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307211619] [2023-08-29 20:30:08,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:08,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:08,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:08,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2023-08-29 20:30:08,142 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-29 20:30:08,142 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:08,142 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2023-08-29 20:30:08,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:09,439 INFO L130 PetriNetUnfolder]: 11949/16674 cut-off events. [2023-08-29 20:30:09,440 INFO L131 PetriNetUnfolder]: For 830/830 co-relation queries the response was YES. [2023-08-29 20:30:09,457 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-29 20:30:09,509 INFO L137 encePairwiseOnDemand]: 261/274 looper letters, 82 selfloop transitions, 26 changer transitions 0/109 dead transitions. [2023-08-29 20:30:09,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 109 transitions, 466 flow [2023-08-29 20:30:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 902 transitions. [2023-08-29 20:30:09,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470281543274244 [2023-08-29 20:30:09,512 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 902 transitions. [2023-08-29 20:30:09,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 902 transitions. [2023-08-29 20:30:09,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:09,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 902 transitions. [2023-08-29 20:30:09,514 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-29 20:30:09,518 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-29 20:30:09,518 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-29 20:30:09,519 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 68 flow. Second operand 7 states and 902 transitions. [2023-08-29 20:30:09,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 109 transitions, 466 flow [2023-08-29 20:30:09,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 109 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:09,522 INFO L231 Difference]: Finished difference. Result has 49 places, 53 transitions, 256 flow [2023-08-29 20:30:09,522 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-29 20:30:09,523 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-29 20:30:09,525 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 53 transitions, 256 flow [2023-08-29 20:30:09,525 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-29 20:30:09,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:09,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:09,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:30:09,526 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-29 20:30:09,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:09,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2073770856, now seen corresponding path program 1 times [2023-08-29 20:30:09,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:09,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548629973] [2023-08-29 20:30:09,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:09,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548629973] [2023-08-29 20:30:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548629973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:09,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:09,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:09,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487077528] [2023-08-29 20:30:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:09,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:09,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:10,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 274 [2023-08-29 20:30:10,042 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-29 20:30:10,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:10,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 274 [2023-08-29 20:30:10,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:11,170 INFO L130 PetriNetUnfolder]: 8273/11675 cut-off events. [2023-08-29 20:30:11,171 INFO L131 PetriNetUnfolder]: For 13903/15021 co-relation queries the response was YES. [2023-08-29 20:30:11,194 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-29 20:30:11,226 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 50 selfloop transitions, 4 changer transitions 9/72 dead transitions. [2023-08-29 20:30:11,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 452 flow [2023-08-29 20:30:11,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions. [2023-08-29 20:30:11,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142335766423358 [2023-08-29 20:30:11,228 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions. [2023-08-29 20:30:11,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions. [2023-08-29 20:30:11,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:11,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions. [2023-08-29 20:30:11,230 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-29 20:30:11,232 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-29 20:30:11,232 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-29 20:30:11,233 INFO L175 Difference]: Start difference. First operand has 49 places, 53 transitions, 256 flow. Second operand 6 states and 681 transitions. [2023-08-29 20:30:11,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 452 flow [2023-08-29 20:30:11,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:30:11,282 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 183 flow [2023-08-29 20:30:11,282 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-29 20:30:11,283 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-29 20:30:11,283 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 183 flow [2023-08-29 20:30:11,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:11,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:11,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:11,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:30:11,284 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-29 20:30:11,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:11,285 INFO L85 PathProgramCache]: Analyzing trace with hash 727216577, now seen corresponding path program 1 times [2023-08-29 20:30:11,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:11,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084338643] [2023-08-29 20:30:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:11,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:11,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:11,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084338643] [2023-08-29 20:30:11,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084338643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:11,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:11,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:30:11,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62412199] [2023-08-29 20:30:11,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:11,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:11,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-29 20:30:11,604 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-29 20:30:11,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:11,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-29 20:30:11,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:12,747 INFO L130 PetriNetUnfolder]: 10219/15120 cut-off events. [2023-08-29 20:30:12,747 INFO L131 PetriNetUnfolder]: For 13273/14662 co-relation queries the response was YES. [2023-08-29 20:30:12,768 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-29 20:30:12,800 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 51 selfloop transitions, 5 changer transitions 26/90 dead transitions. [2023-08-29 20:30:12,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 90 transitions, 538 flow [2023-08-29 20:30:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:30:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:30:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-29 20:30:12,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48613138686131385 [2023-08-29 20:30:12,802 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-29 20:30:12,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-29 20:30:12,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:12,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-29 20:30:12,804 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-29 20:30:12,806 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-29 20:30:12,806 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-29 20:30:12,806 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 183 flow. Second operand 5 states and 666 transitions. [2023-08-29 20:30:12,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 90 transitions, 538 flow [2023-08-29 20:30:12,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 90 transitions, 528 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:12,815 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 229 flow [2023-08-29 20:30:12,815 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-29 20:30:12,815 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-29 20:30:12,816 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 229 flow [2023-08-29 20:30:12,816 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-29 20:30:12,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:12,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:12,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:30:12,816 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-29 20:30:12,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2129466899, now seen corresponding path program 1 times [2023-08-29 20:30:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:12,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464523646] [2023-08-29 20:30:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:12,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:13,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:13,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464523646] [2023-08-29 20:30:13,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464523646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:13,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:13,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:13,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767404213] [2023-08-29 20:30:13,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:13,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:13,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:13,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:13,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:13,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-29 20:30:13,089 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-29 20:30:13,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:13,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-29 20:30:13,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:14,164 INFO L130 PetriNetUnfolder]: 9372/13784 cut-off events. [2023-08-29 20:30:14,165 INFO L131 PetriNetUnfolder]: For 22808/23632 co-relation queries the response was YES. [2023-08-29 20:30:14,195 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-29 20:30:14,237 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 59 selfloop transitions, 14 changer transitions 24/105 dead transitions. [2023-08-29 20:30:14,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 105 transitions, 679 flow [2023-08-29 20:30:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:14,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 786 transitions. [2023-08-29 20:30:14,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781021897810219 [2023-08-29 20:30:14,240 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 786 transitions. [2023-08-29 20:30:14,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 786 transitions. [2023-08-29 20:30:14,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:14,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 786 transitions. [2023-08-29 20:30:14,242 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-29 20:30:14,244 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-29 20:30:14,244 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-29 20:30:14,244 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 229 flow. Second operand 6 states and 786 transitions. [2023-08-29 20:30:14,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 105 transitions, 679 flow [2023-08-29 20:30:14,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 671 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:14,298 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 328 flow [2023-08-29 20:30:14,298 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-29 20:30:14,300 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2023-08-29 20:30:14,301 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 328 flow [2023-08-29 20:30:14,301 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-29 20:30:14,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:14,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:14,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:30:14,303 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-29 20:30:14,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1065236943, now seen corresponding path program 2 times [2023-08-29 20:30:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584900279] [2023-08-29 20:30:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:14,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584900279] [2023-08-29 20:30:14,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584900279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:14,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:14,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:14,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181908698] [2023-08-29 20:30:14,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:14,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:14,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:14,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:14,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:14,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-29 20:30:14,762 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-29 20:30:14,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:14,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-29 20:30:14,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:15,946 INFO L130 PetriNetUnfolder]: 9103/13370 cut-off events. [2023-08-29 20:30:15,946 INFO L131 PetriNetUnfolder]: For 34404/35700 co-relation queries the response was YES. [2023-08-29 20:30:15,973 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-29 20:30:16,005 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 63 selfloop transitions, 20 changer transitions 30/121 dead transitions. [2023-08-29 20:30:16,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 121 transitions, 902 flow [2023-08-29 20:30:16,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-29 20:30:16,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796663190823775 [2023-08-29 20:30:16,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-29 20:30:16,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-29 20:30:16,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:16,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-29 20:30:16,010 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-29 20:30:16,011 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-29 20:30:16,012 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-29 20:30:16,012 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 328 flow. Second operand 7 states and 920 transitions. [2023-08-29 20:30:16,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 121 transitions, 902 flow [2023-08-29 20:30:16,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 121 transitions, 877 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:16,094 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 465 flow [2023-08-29 20:30:16,094 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-29 20:30:16,095 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-08-29 20:30:16,095 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 465 flow [2023-08-29 20:30:16,095 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-29 20:30:16,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:16,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:16,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:30:16,096 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-29 20:30:16,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1068848381, now seen corresponding path program 1 times [2023-08-29 20:30:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:16,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966025961] [2023-08-29 20:30:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966025961] [2023-08-29 20:30:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966025961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:16,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131521638] [2023-08-29 20:30:16,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:16,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:16,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:16,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-29 20:30:16,457 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-29 20:30:16,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:16,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-29 20:30:16,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:17,781 INFO L130 PetriNetUnfolder]: 9599/14197 cut-off events. [2023-08-29 20:30:17,781 INFO L131 PetriNetUnfolder]: For 57070/58634 co-relation queries the response was YES. [2023-08-29 20:30:17,807 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-29 20:30:17,836 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 86 selfloop transitions, 13 changer transitions 21/128 dead transitions. [2023-08-29 20:30:17,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 128 transitions, 1057 flow [2023-08-29 20:30:17,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2023-08-29 20:30:17,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48279457768508866 [2023-08-29 20:30:17,839 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2023-08-29 20:30:17,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2023-08-29 20:30:17,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:17,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2023-08-29 20:30:17,841 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-29 20:30:17,843 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-29 20:30:17,843 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-29 20:30:17,843 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 465 flow. Second operand 7 states and 926 transitions. [2023-08-29 20:30:17,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 128 transitions, 1057 flow [2023-08-29 20:30:17,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 128 transitions, 1029 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:17,952 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 567 flow [2023-08-29 20:30:17,952 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-29 20:30:17,952 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2023-08-29 20:30:17,952 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 567 flow [2023-08-29 20:30:17,953 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-29 20:30:17,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:17,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:17,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:30:17,953 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-29 20:30:17,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:17,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1227493371, now seen corresponding path program 1 times [2023-08-29 20:30:17,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:17,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497142668] [2023-08-29 20:30:17,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:18,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:18,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497142668] [2023-08-29 20:30:18,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497142668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:18,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:18,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:18,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134657377] [2023-08-29 20:30:18,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:18,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:18,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:18,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:18,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:18,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 274 [2023-08-29 20:30:18,673 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-29 20:30:18,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:18,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 274 [2023-08-29 20:30:18,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:20,539 INFO L130 PetriNetUnfolder]: 15046/21241 cut-off events. [2023-08-29 20:30:20,539 INFO L131 PetriNetUnfolder]: For 84344/84344 co-relation queries the response was YES. [2023-08-29 20:30:20,588 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-29 20:30:20,633 INFO L137 encePairwiseOnDemand]: 261/274 looper letters, 74 selfloop transitions, 52 changer transitions 61/187 dead transitions. [2023-08-29 20:30:20,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 187 transitions, 1721 flow [2023-08-29 20:30:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:30:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:30:20,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1235 transitions. [2023-08-29 20:30:20,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45072992700729925 [2023-08-29 20:30:20,637 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1235 transitions. [2023-08-29 20:30:20,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1235 transitions. [2023-08-29 20:30:20,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:20,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1235 transitions. [2023-08-29 20:30:20,640 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-29 20:30:20,642 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-29 20:30:20,643 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-29 20:30:20,643 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 567 flow. Second operand 10 states and 1235 transitions. [2023-08-29 20:30:20,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 187 transitions, 1721 flow [2023-08-29 20:30:20,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 187 transitions, 1664 flow, removed 25 selfloop flow, removed 1 redundant places. [2023-08-29 20:30:20,780 INFO L231 Difference]: Finished difference. Result has 87 places, 89 transitions, 980 flow [2023-08-29 20:30:20,781 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-29 20:30:20,781 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-29 20:30:20,782 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 89 transitions, 980 flow [2023-08-29 20:30:20,782 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-29 20:30:20,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:20,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:20,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:30:20,782 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-29 20:30:20,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1871988717, now seen corresponding path program 2 times [2023-08-29 20:30:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:20,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338284206] [2023-08-29 20:30:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:21,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:21,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:21,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338284206] [2023-08-29 20:30:21,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338284206] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:21,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:21,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:21,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077695931] [2023-08-29 20:30:21,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:21,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:21,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:21,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:21,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-29 20:30:21,143 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-29 20:30:21,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:21,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-29 20:30:21,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:22,840 INFO L130 PetriNetUnfolder]: 12016/17085 cut-off events. [2023-08-29 20:30:22,840 INFO L131 PetriNetUnfolder]: For 148872/150411 co-relation queries the response was YES. [2023-08-29 20:30:22,897 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-29 20:30:22,958 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 101 selfloop transitions, 33 changer transitions 24/173 dead transitions. [2023-08-29 20:30:22,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 173 transitions, 2038 flow [2023-08-29 20:30:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:22,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 916 transitions. [2023-08-29 20:30:22,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47758081334723673 [2023-08-29 20:30:22,961 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 916 transitions. [2023-08-29 20:30:22,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 916 transitions. [2023-08-29 20:30:22,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:22,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 916 transitions. [2023-08-29 20:30:22,963 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-29 20:30:22,965 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-29 20:30:22,965 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-29 20:30:22,965 INFO L175 Difference]: Start difference. First operand has 87 places, 89 transitions, 980 flow. Second operand 7 states and 916 transitions. [2023-08-29 20:30:22,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 173 transitions, 2038 flow [2023-08-29 20:30:23,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 173 transitions, 1937 flow, removed 50 selfloop flow, removed 7 redundant places. [2023-08-29 20:30:23,238 INFO L231 Difference]: Finished difference. Result has 76 places, 102 transitions, 1254 flow [2023-08-29 20:30:23,239 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-29 20:30:23,239 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places. [2023-08-29 20:30:23,239 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 1254 flow [2023-08-29 20:30:23,240 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-29 20:30:23,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:23,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:23,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:30:23,240 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-29 20:30:23,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash 602317750, now seen corresponding path program 1 times [2023-08-29 20:30:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861940018] [2023-08-29 20:30:23,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:23,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:23,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:23,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861940018] [2023-08-29 20:30:23,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861940018] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:23,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:23,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:23,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71842935] [2023-08-29 20:30:23,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:23,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:23,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:23,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:23,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:23,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-29 20:30:23,767 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-29 20:30:23,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:23,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-29 20:30:23,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:25,652 INFO L130 PetriNetUnfolder]: 12752/18231 cut-off events. [2023-08-29 20:30:25,652 INFO L131 PetriNetUnfolder]: For 163046/164811 co-relation queries the response was YES. [2023-08-29 20:30:25,717 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-29 20:30:25,780 INFO L137 encePairwiseOnDemand]: 265/274 looper letters, 143 selfloop transitions, 74 changer transitions 19/251 dead transitions. [2023-08-29 20:30:25,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 251 transitions, 3199 flow [2023-08-29 20:30:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:30:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:30:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1448 transitions. [2023-08-29 20:30:25,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4804246848042468 [2023-08-29 20:30:25,784 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1448 transitions. [2023-08-29 20:30:25,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1448 transitions. [2023-08-29 20:30:25,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:25,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1448 transitions. [2023-08-29 20:30:25,787 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-29 20:30:25,789 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-29 20:30:25,790 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-29 20:30:25,790 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 1254 flow. Second operand 11 states and 1448 transitions. [2023-08-29 20:30:25,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 251 transitions, 3199 flow [2023-08-29 20:30:26,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 251 transitions, 2907 flow, removed 116 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:26,310 INFO L231 Difference]: Finished difference. Result has 89 places, 152 transitions, 2123 flow [2023-08-29 20:30:26,310 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-29 20:30:26,310 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2023-08-29 20:30:26,310 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 152 transitions, 2123 flow [2023-08-29 20:30:26,311 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-29 20:30:26,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:26,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:26,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:30:26,311 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-29 20:30:26,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash 663091390, now seen corresponding path program 2 times [2023-08-29 20:30:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589851295] [2023-08-29 20:30:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:27,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:27,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589851295] [2023-08-29 20:30:27,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589851295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:27,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:27,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:27,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047491699] [2023-08-29 20:30:27,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:27,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:27,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:27,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:27,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:27,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 274 [2023-08-29 20:30:27,111 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-29 20:30:27,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:27,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 274 [2023-08-29 20:30:27,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:29,871 INFO L130 PetriNetUnfolder]: 19822/27803 cut-off events. [2023-08-29 20:30:29,872 INFO L131 PetriNetUnfolder]: For 222134/222134 co-relation queries the response was YES. [2023-08-29 20:30:29,943 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-29 20:30:30,011 INFO L137 encePairwiseOnDemand]: 264/274 looper letters, 135 selfloop transitions, 83 changer transitions 56/274 dead transitions. [2023-08-29 20:30:30,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 274 transitions, 4006 flow [2023-08-29 20:30:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:30:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:30:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2023-08-29 20:30:30,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562043795620438 [2023-08-29 20:30:30,013 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2023-08-29 20:30:30,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2023-08-29 20:30:30,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:30,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2023-08-29 20:30:30,015 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-29 20:30:30,017 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-29 20:30:30,018 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-29 20:30:30,018 INFO L175 Difference]: Start difference. First operand has 89 places, 152 transitions, 2123 flow. Second operand 8 states and 1000 transitions. [2023-08-29 20:30:30,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 274 transitions, 4006 flow [2023-08-29 20:30:30,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 274 transitions, 3885 flow, removed 60 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:30,434 INFO L231 Difference]: Finished difference. Result has 99 places, 176 transitions, 2774 flow [2023-08-29 20:30:30,434 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-29 20:30:30,434 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2023-08-29 20:30:30,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 176 transitions, 2774 flow [2023-08-29 20:30:30,435 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-29 20:30:30,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:30,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:30,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:30:30,435 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-29 20:30:30,435 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1851695294, now seen corresponding path program 1 times [2023-08-29 20:30:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5254731] [2023-08-29 20:30:30,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5254731] [2023-08-29 20:30:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5254731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:30,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:30:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534205187] [2023-08-29 20:30:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:30,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:30:30,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:30:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:30:30,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-29 20:30:30,559 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-29 20:30:30,559 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:30,559 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-29 20:30:30,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:31,282 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-29 20:30:31,282 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,282 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,283 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,283 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,283 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-29 20:30:31,283 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,283 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,283 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,283 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:31,384 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-29 20:30:31,384 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,384 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,385 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,385 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,385 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-29 20:30:31,385 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,385 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,385 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,386 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,386 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-29 20:30:31,386 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,386 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,386 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,386 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,386 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-29 20:30:31,386 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,387 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,387 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,387 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,415 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-29 20:30:31,416 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-08-29 20:30:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-29 20:30:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-29 20:30:31,416 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-29 20:30:31,435 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-29 20:30:31,435 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,435 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,435 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,435 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,435 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-29 20:30:31,435 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,435 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,435 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,436 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,436 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-29 20:30:31,436 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,436 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,436 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:31,436 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:32,638 INFO L130 PetriNetUnfolder]: 12230/17931 cut-off events. [2023-08-29 20:30:32,638 INFO L131 PetriNetUnfolder]: For 273785/282025 co-relation queries the response was YES. [2023-08-29 20:30:32,684 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-29 20:30:32,735 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 363 selfloop transitions, 10 changer transitions 30/437 dead transitions. [2023-08-29 20:30:32,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 437 transitions, 8024 flow [2023-08-29 20:30:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:30:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:30:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-29 20:30:32,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48175182481751827 [2023-08-29 20:30:32,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-29 20:30:32,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-29 20:30:32,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:32,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-29 20:30:32,738 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-29 20:30:32,739 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-29 20:30:32,740 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-29 20:30:32,740 INFO L175 Difference]: Start difference. First operand has 99 places, 176 transitions, 2774 flow. Second operand 5 states and 660 transitions. [2023-08-29 20:30:32,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 437 transitions, 8024 flow [2023-08-29 20:30:32,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 437 transitions, 7945 flow, removed 39 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:32,861 INFO L231 Difference]: Finished difference. Result has 98 places, 174 transitions, 2675 flow [2023-08-29 20:30:32,861 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-29 20:30:32,862 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 46 predicate places. [2023-08-29 20:30:32,862 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 174 transitions, 2675 flow [2023-08-29 20:30:32,862 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-29 20:30:32,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:32,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:32,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:30:32,863 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-29 20:30:32,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash -305095829, now seen corresponding path program 1 times [2023-08-29 20:30:32,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:32,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034951598] [2023-08-29 20:30:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:32,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:32,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:32,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034951598] [2023-08-29 20:30:32,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034951598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:32,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:32,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:32,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571585324] [2023-08-29 20:30:32,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:32,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:32,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:32,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-29 20:30:32,997 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-29 20:30:32,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:32,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-29 20:30:32,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:33,727 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-29 20:30:33,727 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,727 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,727 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,727 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,728 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-29 20:30:33,728 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,728 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,728 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,728 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-08-29 20:30:33,804 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-29 20:30:33,805 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 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-29 20:30:33,805 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,805 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-29 20:30:33,806 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,806 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,806 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,806 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,834 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-29 20:30:33,834 INFO L383 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2023-08-29 20:30:33,835 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-29 20:30:33,835 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-29 20:30:33,835 INFO L386 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2023-08-29 20:30:33,852 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-29 20:30:33,852 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,852 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,852 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-29 20:30:33,852 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,853 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-29 20:30:33,853 INFO L383 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:33,853 INFO L386 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-08-29 20:30:34,730 INFO L130 PetriNetUnfolder]: 9205/13959 cut-off events. [2023-08-29 20:30:34,730 INFO L131 PetriNetUnfolder]: For 226594/234197 co-relation queries the response was YES. [2023-08-29 20:30:34,779 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-29 20:30:34,825 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 426 selfloop transitions, 19 changer transitions 71/549 dead transitions. [2023-08-29 20:30:34,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 549 transitions, 10057 flow [2023-08-29 20:30:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 925 transitions. [2023-08-29 20:30:34,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48227320125130346 [2023-08-29 20:30:34,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 925 transitions. [2023-08-29 20:30:34,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 925 transitions. [2023-08-29 20:30:34,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:34,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 925 transitions. [2023-08-29 20:30:34,829 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-29 20:30:34,831 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-29 20:30:34,831 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-29 20:30:34,832 INFO L175 Difference]: Start difference. First operand has 98 places, 174 transitions, 2675 flow. Second operand 7 states and 925 transitions. [2023-08-29 20:30:34,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 549 transitions, 10057 flow [2023-08-29 20:30:34,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 549 transitions, 9739 flow, removed 35 selfloop flow, removed 6 redundant places. [2023-08-29 20:30:35,003 INFO L231 Difference]: Finished difference. Result has 101 places, 166 transitions, 2453 flow [2023-08-29 20:30:35,003 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-29 20:30:35,004 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2023-08-29 20:30:35,004 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 166 transitions, 2453 flow [2023-08-29 20:30:35,004 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-29 20:30:35,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:35,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:35,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:30:35,005 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-29 20:30:35,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1254309455, now seen corresponding path program 1 times [2023-08-29 20:30:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419456011] [2023-08-29 20:30:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:35,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419456011] [2023-08-29 20:30:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419456011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:35,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:35,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521064035] [2023-08-29 20:30:35,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:35,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:35,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:35,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:35,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:35,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 274 [2023-08-29 20:30:35,577 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-29 20:30:35,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:35,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 274 [2023-08-29 20:30:35,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:38,124 INFO L130 PetriNetUnfolder]: 14478/21951 cut-off events. [2023-08-29 20:30:38,124 INFO L131 PetriNetUnfolder]: For 286828/287596 co-relation queries the response was YES. [2023-08-29 20:30:38,208 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-29 20:30:38,244 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 134 selfloop transitions, 14 changer transitions 137/290 dead transitions. [2023-08-29 20:30:38,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 290 transitions, 4706 flow [2023-08-29 20:30:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:30:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:30:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-08-29 20:30:38,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46228710462287104 [2023-08-29 20:30:38,246 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-08-29 20:30:38,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-08-29 20:30:38,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:38,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-08-29 20:30:38,248 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-29 20:30:38,250 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-29 20:30:38,250 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-29 20:30:38,250 INFO L175 Difference]: Start difference. First operand has 101 places, 166 transitions, 2453 flow. Second operand 6 states and 760 transitions. [2023-08-29 20:30:38,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 290 transitions, 4706 flow [2023-08-29 20:30:39,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 290 transitions, 4606 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:39,927 INFO L231 Difference]: Finished difference. Result has 107 places, 115 transitions, 1709 flow [2023-08-29 20:30:39,927 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-29 20:30:39,927 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 55 predicate places. [2023-08-29 20:30:39,927 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 1709 flow [2023-08-29 20:30:39,928 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-29 20:30:39,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:39,928 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-29 20:30:39,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:30:39,928 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-29 20:30:39,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:39,928 INFO L85 PathProgramCache]: Analyzing trace with hash 238594536, now seen corresponding path program 1 times [2023-08-29 20:30:39,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:39,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984389595] [2023-08-29 20:30:39,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:39,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:40,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984389595] [2023-08-29 20:30:40,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984389595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:40,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:40,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:40,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487274230] [2023-08-29 20:30:40,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:40,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:40,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:40,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:40,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-29 20:30:40,091 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-29 20:30:40,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:40,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-29 20:30:40,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:40,958 INFO L130 PetriNetUnfolder]: 4036/6747 cut-off events. [2023-08-29 20:30:40,958 INFO L131 PetriNetUnfolder]: For 101277/103124 co-relation queries the response was YES. [2023-08-29 20:30:40,984 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-29 20:30:40,999 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 204 selfloop transitions, 18 changer transitions 60/303 dead transitions. [2023-08-29 20:30:40,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 303 transitions, 5261 flow [2023-08-29 20:30:41,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:41,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 926 transitions. [2023-08-29 20:30:41,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48279457768508866 [2023-08-29 20:30:41,002 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 926 transitions. [2023-08-29 20:30:41,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 926 transitions. [2023-08-29 20:30:41,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:41,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 926 transitions. [2023-08-29 20:30:41,004 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-29 20:30:41,005 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-29 20:30:41,006 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-29 20:30:41,006 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 1709 flow. Second operand 7 states and 926 transitions. [2023-08-29 20:30:41,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 303 transitions, 5261 flow [2023-08-29 20:30:41,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 303 transitions, 4977 flow, removed 111 selfloop flow, removed 9 redundant places. [2023-08-29 20:30:41,194 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 1530 flow [2023-08-29 20:30:41,194 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-29 20:30:41,194 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 49 predicate places. [2023-08-29 20:30:41,194 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 1530 flow [2023-08-29 20:30:41,194 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-29 20:30:41,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:41,195 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-29 20:30:41,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:30:41,195 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-29 20:30:41,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2041197205, now seen corresponding path program 1 times [2023-08-29 20:30:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:41,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738725964] [2023-08-29 20:30:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738725964] [2023-08-29 20:30:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738725964] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:41,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:30:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199166554] [2023-08-29 20:30:41,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:41,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:41,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:41,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:41,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 274 [2023-08-29 20:30:41,437 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-29 20:30:41,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:41,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 274 [2023-08-29 20:30:41,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:42,148 INFO L130 PetriNetUnfolder]: 3807/6408 cut-off events. [2023-08-29 20:30:42,148 INFO L131 PetriNetUnfolder]: For 75704/77033 co-relation queries the response was YES. [2023-08-29 20:30:42,171 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-29 20:30:42,182 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 172 selfloop transitions, 23 changer transitions 72/283 dead transitions. [2023-08-29 20:30:42,182 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 283 transitions, 4644 flow [2023-08-29 20:30:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:30:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:30:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1165 transitions. [2023-08-29 20:30:42,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724249797242498 [2023-08-29 20:30:42,184 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1165 transitions. [2023-08-29 20:30:42,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1165 transitions. [2023-08-29 20:30:42,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:42,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1165 transitions. [2023-08-29 20:30:42,186 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-29 20:30:42,188 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-29 20:30:42,188 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-29 20:30:42,189 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 1530 flow. Second operand 9 states and 1165 transitions. [2023-08-29 20:30:42,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 283 transitions, 4644 flow [2023-08-29 20:30:42,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 283 transitions, 4295 flow, removed 153 selfloop flow, removed 5 redundant places. [2023-08-29 20:30:42,587 INFO L231 Difference]: Finished difference. Result has 107 places, 97 transitions, 1224 flow [2023-08-29 20:30:42,587 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-29 20:30:42,588 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 55 predicate places. [2023-08-29 20:30:42,588 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 97 transitions, 1224 flow [2023-08-29 20:30:42,588 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-29 20:30:42,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:42,588 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-29 20:30:42,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:30:42,589 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-29 20:30:42,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:42,589 INFO L85 PathProgramCache]: Analyzing trace with hash -464627310, now seen corresponding path program 1 times [2023-08-29 20:30:42,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:42,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573964911] [2023-08-29 20:30:42,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:43,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:43,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573964911] [2023-08-29 20:30:43,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573964911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:43,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:43,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452808007] [2023-08-29 20:30:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:43,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:43,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:43,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 274 [2023-08-29 20:30:43,104 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-29 20:30:43,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:43,105 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 274 [2023-08-29 20:30:43,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:43,598 INFO L130 PetriNetUnfolder]: 2505/4053 cut-off events. [2023-08-29 20:30:43,598 INFO L131 PetriNetUnfolder]: For 38418/38532 co-relation queries the response was YES. [2023-08-29 20:30:43,612 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-29 20:30:43,618 INFO L137 encePairwiseOnDemand]: 263/274 looper letters, 89 selfloop transitions, 12 changer transitions 114/219 dead transitions. [2023-08-29 20:30:43,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 219 transitions, 3078 flow [2023-08-29 20:30:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2023-08-29 20:30:43,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44577685088633995 [2023-08-29 20:30:43,620 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2023-08-29 20:30:43,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2023-08-29 20:30:43,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:43,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2023-08-29 20:30:43,621 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-29 20:30:43,622 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-29 20:30:43,622 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-29 20:30:43,622 INFO L175 Difference]: Start difference. First operand has 107 places, 97 transitions, 1224 flow. Second operand 7 states and 855 transitions. [2023-08-29 20:30:43,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 219 transitions, 3078 flow [2023-08-29 20:30:43,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 219 transitions, 2447 flow, removed 189 selfloop flow, removed 20 redundant places. [2023-08-29 20:30:43,736 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 908 flow [2023-08-29 20:30:43,736 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-29 20:30:43,737 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 43 predicate places. [2023-08-29 20:30:43,737 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 908 flow [2023-08-29 20:30:43,737 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-29 20:30:43,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:43,737 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-29 20:30:43,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:30:43,737 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-29 20:30:43,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1673893204, now seen corresponding path program 2 times [2023-08-29 20:30:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653363704] [2023-08-29 20:30:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:43,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653363704] [2023-08-29 20:30:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653363704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:43,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810638525] [2023-08-29 20:30:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:43,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:43,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:43,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-29 20:30:43,903 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-29 20:30:43,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:43,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-29 20:30:43,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:44,126 INFO L130 PetriNetUnfolder]: 1194/2008 cut-off events. [2023-08-29 20:30:44,126 INFO L131 PetriNetUnfolder]: For 9611/9669 co-relation queries the response was YES. [2023-08-29 20:30:44,132 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-29 20:30:44,134 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 50 selfloop transitions, 1 changer transitions 94/149 dead transitions. [2023-08-29 20:30:44,134 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 149 transitions, 1798 flow [2023-08-29 20:30:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:30:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:30:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2023-08-29 20:30:44,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47153284671532847 [2023-08-29 20:30:44,136 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2023-08-29 20:30:44,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2023-08-29 20:30:44,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:44,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2023-08-29 20:30:44,137 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-29 20:30:44,138 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-29 20:30:44,138 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-29 20:30:44,138 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 908 flow. Second operand 5 states and 646 transitions. [2023-08-29 20:30:44,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 149 transitions, 1798 flow [2023-08-29 20:30:44,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 149 transitions, 1662 flow, removed 18 selfloop flow, removed 10 redundant places. [2023-08-29 20:30:44,162 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 436 flow [2023-08-29 20:30:44,162 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-29 20:30:44,163 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 35 predicate places. [2023-08-29 20:30:44,163 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 436 flow [2023-08-29 20:30:44,164 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-29 20:30:44,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:44,164 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-29 20:30:44,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:30:44,164 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-29 20:30:44,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:44,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1966233204, now seen corresponding path program 3 times [2023-08-29 20:30:44,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:44,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904816262] [2023-08-29 20:30:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:44,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:44,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:44,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904816262] [2023-08-29 20:30:44,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904816262] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:44,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:44,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:30:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089478816] [2023-08-29 20:30:44,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:44,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:30:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:30:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:30:45,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 274 [2023-08-29 20:30:45,084 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-29 20:30:45,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:45,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 274 [2023-08-29 20:30:45,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:45,373 INFO L130 PetriNetUnfolder]: 679/1157 cut-off events. [2023-08-29 20:30:45,373 INFO L131 PetriNetUnfolder]: For 3796/3802 co-relation queries the response was YES. [2023-08-29 20:30:45,376 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-29 20:30:45,377 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 68 selfloop transitions, 8 changer transitions 39/118 dead transitions. [2023-08-29 20:30:45,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 118 transitions, 1048 flow [2023-08-29 20:30:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-08-29 20:30:45,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562043795620438 [2023-08-29 20:30:45,378 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-08-29 20:30:45,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-08-29 20:30:45,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:45,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-08-29 20:30:45,379 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-29 20:30:45,380 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-29 20:30:45,381 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-29 20:30:45,381 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 436 flow. Second operand 7 states and 875 transitions. [2023-08-29 20:30:45,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 118 transitions, 1048 flow [2023-08-29 20:30:45,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 118 transitions, 946 flow, removed 25 selfloop flow, removed 14 redundant places. [2023-08-29 20:30:45,389 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 376 flow [2023-08-29 20:30:45,389 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-29 20:30:45,390 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-29 20:30:45,390 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 376 flow [2023-08-29 20:30:45,390 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-29 20:30:45,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:45,390 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-29 20:30:45,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:30:45,390 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-29 20:30:45,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1330975128, now seen corresponding path program 4 times [2023-08-29 20:30:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:45,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602788757] [2023-08-29 20:30:45,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:45,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:30:45,445 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:30:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:30:45,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:30:45,510 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:30:45,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:30:45,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:30:45,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:30:45,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:30:45,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:30:45,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:30:45,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:30:45,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:30:45,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:30:45,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:30:45,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:30:45,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:30:45,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:30:45,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:30:45,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:30:45,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:30:45,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:30:45,519 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:45,523 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:30:45,523 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:30:45,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:30:45 BasicIcfg [2023-08-29 20:30:45,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:30:45,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:30:45,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:30:45,584 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:30:45,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:01" (3/4) ... [2023-08-29 20:30:45,586 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:30:45,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:30:45,587 INFO L158 Benchmark]: Toolchain (without parser) took 45175.98ms. Allocated memory was 88.1MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 63.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-08-29 20:30:45,587 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:30:45,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.28ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 64.9MB in the end (delta: -1.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2023-08-29 20:30:45,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.18ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:30:45,587 INFO L158 Benchmark]: Boogie Preprocessor took 24.97ms. Allocated memory is still 88.1MB. Free memory was 62.1MB in the beginning and 60.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:30:45,588 INFO L158 Benchmark]: RCFGBuilder took 590.67ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 52.1MB in the end (delta: 7.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2023-08-29 20:30:45,588 INFO L158 Benchmark]: TraceAbstraction took 44098.66ms. Allocated memory was 88.1MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 51.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-08-29 20:30:45,588 INFO L158 Benchmark]: Witness Printer took 2.25ms. Allocated memory is still 5.8GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:30:45,589 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 62.9MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.28ms. Allocated memory is still 88.1MB. Free memory was 63.1MB in the beginning and 64.9MB in the end (delta: -1.8MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.18ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.97ms. Allocated memory is still 88.1MB. Free memory was 62.1MB in the beginning and 60.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 590.67ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 52.1MB in the end (delta: 7.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44098.66ms. Allocated memory was 88.1MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 51.1MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 2.25ms. Allocated memory is still 5.8GB. Free memory is still 2.0GB. 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: 44.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1602 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1318 mSDsluCounter, 984 SdHoareTripleChecker+Invalid, 2.6s 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.6s 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.4s SatisfiabilityAnalysisTime, 7.2s 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-29 20:30:45,611 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 AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:30:47,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:30:47,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:30:47,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:30:47,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:30:47,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:30:47,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:30:47,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:30:47,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:30:47,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:30:47,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:30:47,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:30:47,573 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:30:47,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:30:47,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:30:47,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:30:47,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:30:47,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:30:47,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:30:47,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:30:47,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:30:47,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:30:47,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:30:47,589 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:30:47,591 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:30:47,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:30:47,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:30:47,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:30:47,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:30:47,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:30:47,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:30:47,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:30:47,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:30:47,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:30:47,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:30:47,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:30:47,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:30:47,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:30:47,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:30:47,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:30:47,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:30:47,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:30:47,626 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:30:47,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:30:47,627 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:30:47,627 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:30:47,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:30:47,628 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:30:47,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:30:47,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:30:47,629 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:30:47,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:30:47,629 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:30:47,629 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:30:47,630 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:30:47,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:47,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:30:47,631 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:30:47,632 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:30:47,632 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:30:47,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:30:47,632 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:30:47,632 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:30:47,632 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 -> AFTER [2023-08-29 20:30:47,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:30:47,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:30:47,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:30:47,875 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:30:47,876 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:30:47,877 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-29 20:30:48,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:30:48,972 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:30:48,973 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i [2023-08-29 20:30:48,980 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bca81973/970be69c702241c0a633b03c609e85a8/FLAG3d8036fc2 [2023-08-29 20:30:48,993 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bca81973/970be69c702241c0a633b03c609e85a8 [2023-08-29 20:30:48,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:30:48,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:30:48,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:48,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:30:48,998 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:30:48,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:48" (1/1) ... [2023-08-29 20:30:48,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0d9426 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:48, skipping insertion in model container [2023-08-29 20:30:48,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:48" (1/1) ... [2023-08-29 20:30:49,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:30:49,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:30:49,190 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-29 20:30:49,359 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:49,369 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:30:49,377 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-29 20:30:49,416 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:49,448 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:49,448 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:49,453 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:30:49,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49 WrapperNode [2023-08-29 20:30:49,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:49,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:49,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:30:49,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:30:49,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,527 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-29 20:30:49,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:49,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:30:49,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:30:49,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:30:49,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,559 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:30:49,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:30:49,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:30:49,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:30:49,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (1/1) ... [2023-08-29 20:30:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:49,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:30:49,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:30:49,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:30:49,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:30:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:30:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:30:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:30:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:30:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:30:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:30:49,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:30:49,627 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:30:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:30:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:30:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:30:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:30:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:30:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:30:49,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:30:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:30:49,629 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:30:49,785 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:30:49,786 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:30:50,088 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:30:50,181 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:30:50,181 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:30:50,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:50 BoogieIcfgContainer [2023-08-29 20:30:50,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:30:50,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:30:50,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:30:50,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:30:50,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:30:48" (1/3) ... [2023-08-29 20:30:50,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dfaf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:50, skipping insertion in model container [2023-08-29 20:30:50,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:49" (2/3) ... [2023-08-29 20:30:50,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56dfaf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:50, skipping insertion in model container [2023-08-29 20:30:50,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:50" (3/3) ... [2023-08-29 20:30:50,189 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-08-29 20:30:50,200 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:30:50,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:30:50,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:30:50,252 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:30:50,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2023-08-29 20:30:50,334 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-29 20:30:50,334 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:50,341 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-29 20:30:50,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2023-08-29 20:30:50,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:50,350 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:30:50,358 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:50,361 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:50,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:50,399 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-29 20:30:50,399 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:50,400 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-29 20:30:50,402 INFO L119 LiptonReduction]: Number of co-enabled transitions 3210 [2023-08-29 20:30:58,057 INFO L134 LiptonReduction]: Checked pairs total: 9300 [2023-08-29 20:30:58,057 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-29 20:30:58,066 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:30:58,070 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;@400181e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:30:58,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:30:58,071 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:30:58,071 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:58,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:58,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:30:58,072 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-29 20:30:58,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times [2023-08-29 20:30:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:30:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600202488] [2023-08-29 20:30:58,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:58,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:30:58,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:30:58,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:30:58,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:30:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:58,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:30:58,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:30:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:58,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:30:58,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:30:58,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600202488] [2023-08-29 20:30:58,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600202488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:58,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:58,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:30:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026197788] [2023-08-29 20:30:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:58,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:30:58,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:30:58,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:30:58,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:30:58,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 274 [2023-08-29 20:30:58,192 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-29 20:30:58,201 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:58,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 274 [2023-08-29 20:30:58,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:58,844 INFO L130 PetriNetUnfolder]: 4337/6002 cut-off events. [2023-08-29 20:30:58,844 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-08-29 20:30:58,851 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-29 20:30:58,876 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-29 20:30:58,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-29 20:30:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:30:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:30:58,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 285 transitions. [2023-08-29 20:30:58,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200729927007299 [2023-08-29 20:30:58,916 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 285 transitions. [2023-08-29 20:30:58,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 285 transitions. [2023-08-29 20:30:58,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:58,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 285 transitions. [2023-08-29 20:30:58,934 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-29 20:30:58,970 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-29 20:30:58,971 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-29 20:30:58,972 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 285 transitions. [2023-08-29 20:30:58,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-29 20:30:58,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:58,976 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-29 20:30:58,977 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-29 20:30:58,980 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-29 20:30:58,980 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-29 20:30:58,980 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-29 20:30:58,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:58,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:59,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 20:30:59,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:30:59,195 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-29 20:30:59,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:59,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1515871887, now seen corresponding path program 1 times [2023-08-29 20:30:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:30:59,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575174575] [2023-08-29 20:30:59,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:59,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:30:59,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:30:59,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:30:59,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:30:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:59,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:30:59,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:30:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:59,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:30:59,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:30:59,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575174575] [2023-08-29 20:30:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575174575] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:59,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:59,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:30:59,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498470936] [2023-08-29 20:30:59,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:59,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:59,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:30:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:59,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:59,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 274 [2023-08-29 20:30:59,308 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-29 20:30:59,308 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:59,308 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 274 [2023-08-29 20:30:59,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:59,775 INFO L130 PetriNetUnfolder]: 3415/5026 cut-off events. [2023-08-29 20:30:59,776 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:59,780 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-29 20:30:59,792 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 35 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-29 20:30:59,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 174 flow [2023-08-29 20:30:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:30:59,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048661800486618 [2023-08-29 20:30:59,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:30:59,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:30:59,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:59,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:30:59,797 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-29 20:30:59,799 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-29 20:30:59,800 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-29 20:30:59,800 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:30:59,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 174 flow [2023-08-29 20:30:59,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:30:59,801 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-08-29 20:30:59,801 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-29 20:30:59,802 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-29 20:30:59,802 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-08-29 20:30:59,802 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-29 20:30:59,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:59,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:59,814 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-29 20:31:00,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:00,016 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-29 20:31:00,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 854685866, now seen corresponding path program 1 times [2023-08-29 20:31:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:00,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298153854] [2023-08-29 20:31:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:00,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:00,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:00,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:00,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:31:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:00,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:00,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:00,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:00,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:00,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298153854] [2023-08-29 20:31:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298153854] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:00,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:00,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239862118] [2023-08-29 20:31:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:00,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:00,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:00,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:00,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-29 20:31:00,146 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-29 20:31:00,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:00,146 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-29 20:31:00,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:00,512 INFO L130 PetriNetUnfolder]: 2413/3512 cut-off events. [2023-08-29 20:31:00,512 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2023-08-29 20:31:00,516 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-29 20:31:00,525 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 35 selfloop transitions, 5 changer transitions 23/67 dead transitions. [2023-08-29 20:31:00,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 67 transitions, 284 flow [2023-08-29 20:31:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-29 20:31:00,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854014598540146 [2023-08-29 20:31:00,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-29 20:31:00,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-29 20:31:00,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:00,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-29 20:31:00,529 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-29 20:31:00,531 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-29 20:31:00,531 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-29 20:31:00,531 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 5 states and 665 transitions. [2023-08-29 20:31:00,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 67 transitions, 284 flow [2023-08-29 20:31:00,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:00,533 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 107 flow [2023-08-29 20:31:00,533 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-29 20:31:00,534 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -6 predicate places. [2023-08-29 20:31:00,534 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 107 flow [2023-08-29 20:31:00,534 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-29 20:31:00,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:00,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:00,544 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-29 20:31:00,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:00,746 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-29 20:31:00,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:00,747 INFO L85 PathProgramCache]: Analyzing trace with hash 587731453, now seen corresponding path program 1 times [2023-08-29 20:31:00,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:00,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311824747] [2023-08-29 20:31:00,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:00,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:00,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:00,748 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:00,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:31:00,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:00,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:00,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:00,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:00,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:00,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311824747] [2023-08-29 20:31:00,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311824747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:00,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:00,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551327000] [2023-08-29 20:31:00,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:00,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:00,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:00,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:00,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:00,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-29 20:31:00,889 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-29 20:31:00,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:00,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-29 20:31:00,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:01,196 INFO L130 PetriNetUnfolder]: 1306/2027 cut-off events. [2023-08-29 20:31:01,197 INFO L131 PetriNetUnfolder]: For 782/782 co-relation queries the response was YES. [2023-08-29 20:31:01,200 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-29 20:31:01,206 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 46 selfloop transitions, 9 changer transitions 23/82 dead transitions. [2023-08-29 20:31:01,206 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 425 flow [2023-08-29 20:31:01,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 800 transitions. [2023-08-29 20:31:01,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48661800486618007 [2023-08-29 20:31:01,209 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 800 transitions. [2023-08-29 20:31:01,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 800 transitions. [2023-08-29 20:31:01,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:01,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 800 transitions. [2023-08-29 20:31:01,211 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-29 20:31:01,213 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-29 20:31:01,214 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-29 20:31:01,214 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 107 flow. Second operand 6 states and 800 transitions. [2023-08-29 20:31:01,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 425 flow [2023-08-29 20:31:01,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:01,221 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 172 flow [2023-08-29 20:31:01,222 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-29 20:31:01,222 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-29 20:31:01,222 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 172 flow [2023-08-29 20:31:01,223 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-29 20:31:01,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:01,223 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-29 20:31:01,232 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 (5)] Ended with exit code 0 [2023-08-29 20:31:01,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:01,430 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-29 20:31:01,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash 899882748, now seen corresponding path program 1 times [2023-08-29 20:31:01,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:01,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165073156] [2023-08-29 20:31:01,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:01,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:01,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:01,432 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:01,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:31:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:01,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:31:01,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:01,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:01,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:01,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165073156] [2023-08-29 20:31:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165073156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:01,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:01,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:31:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171526588] [2023-08-29 20:31:01,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:01,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:01,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-29 20:31:01,584 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-29 20:31:01,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:01,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-29 20:31:01,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:01,852 INFO L130 PetriNetUnfolder]: 748/1208 cut-off events. [2023-08-29 20:31:01,852 INFO L131 PetriNetUnfolder]: For 1257/1257 co-relation queries the response was YES. [2023-08-29 20:31:01,854 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-29 20:31:01,857 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 55 selfloop transitions, 13 changer transitions 23/95 dead transitions. [2023-08-29 20:31:01,857 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 95 transitions, 586 flow [2023-08-29 20:31:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 933 transitions. [2023-08-29 20:31:01,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.486444212721585 [2023-08-29 20:31:01,859 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 933 transitions. [2023-08-29 20:31:01,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 933 transitions. [2023-08-29 20:31:01,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:01,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 933 transitions. [2023-08-29 20:31:01,861 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-29 20:31:01,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-29 20:31:01,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-29 20:31:01,864 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 172 flow. Second operand 7 states and 933 transitions. [2023-08-29 20:31:01,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 95 transitions, 586 flow [2023-08-29 20:31:01,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 95 transitions, 524 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:01,869 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 222 flow [2023-08-29 20:31:01,869 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-29 20:31:01,870 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-29 20:31:01,870 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 222 flow [2023-08-29 20:31:01,870 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-29 20:31:01,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:01,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:01,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:02,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:02,078 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-29 20:31:02,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 894031473, now seen corresponding path program 1 times [2023-08-29 20:31:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799526977] [2023-08-29 20:31:02,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:02,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:02,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:02,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:02,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:31:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:02,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:31:02,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:02,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:02,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799526977] [2023-08-29 20:31:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799526977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:02,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:02,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:31:02,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004066742] [2023-08-29 20:31:02,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:02,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:31:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:31:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:31:02,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-29 20:31:02,248 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-29 20:31:02,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:02,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-29 20:31:02,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:02,529 INFO L130 PetriNetUnfolder]: 625/996 cut-off events. [2023-08-29 20:31:02,530 INFO L131 PetriNetUnfolder]: For 1004/1004 co-relation queries the response was YES. [2023-08-29 20:31:02,531 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-29 20:31:02,534 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 51 selfloop transitions, 17 changer transitions 12/84 dead transitions. [2023-08-29 20:31:02,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 530 flow [2023-08-29 20:31:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:31:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:31:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1042 transitions. [2023-08-29 20:31:02,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47536496350364965 [2023-08-29 20:31:02,537 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1042 transitions. [2023-08-29 20:31:02,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1042 transitions. [2023-08-29 20:31:02,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:02,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1042 transitions. [2023-08-29 20:31:02,539 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-29 20:31:02,541 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-29 20:31:02,541 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-29 20:31:02,541 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 222 flow. Second operand 8 states and 1042 transitions. [2023-08-29 20:31:02,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 530 flow [2023-08-29 20:31:02,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 468 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:31:02,548 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2023-08-29 20:31:02,548 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-29 20:31:02,548 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-29 20:31:02,548 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2023-08-29 20:31:02,549 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-29 20:31:02,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:02,549 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-29 20:31:02,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:02,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:02,756 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-29 20:31:02,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 292457730, now seen corresponding path program 1 times [2023-08-29 20:31:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:02,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893052082] [2023-08-29 20:31:02,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:02,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:02,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:02,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:02,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:31:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:02,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:31:02,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:03,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:03,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893052082] [2023-08-29 20:31:03,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1893052082] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530062393] [2023-08-29 20:31:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:03,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:03,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:03,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:03,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:03,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 274 [2023-08-29 20:31:03,630 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-29 20:31:03,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:03,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 274 [2023-08-29 20:31:03,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:03,903 INFO L130 PetriNetUnfolder]: 615/1000 cut-off events. [2023-08-29 20:31:03,903 INFO L131 PetriNetUnfolder]: For 1418/1418 co-relation queries the response was YES. [2023-08-29 20:31:03,904 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-29 20:31:03,907 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 53 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-29 20:31:03,907 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 455 flow [2023-08-29 20:31:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions. [2023-08-29 20:31:03,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099756690997567 [2023-08-29 20:31:03,909 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 674 transitions. [2023-08-29 20:31:03,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions. [2023-08-29 20:31:03,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:03,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions. [2023-08-29 20:31:03,910 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-29 20:31:03,912 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-29 20:31:03,912 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-29 20:31:03,912 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 6 states and 674 transitions. [2023-08-29 20:31:03,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 455 flow [2023-08-29 20:31:03,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 366 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-29 20:31:03,914 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 158 flow [2023-08-29 20:31:03,914 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-29 20:31:03,915 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-29 20:31:03,915 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 158 flow [2023-08-29 20:31:03,915 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-29 20:31:03,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:03,915 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-29 20:31:03,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:04,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:04,123 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-29 20:31:04,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:04,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1837251032, now seen corresponding path program 1 times [2023-08-29 20:31:04,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:04,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25700527] [2023-08-29 20:31:04,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:04,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:04,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:04,125 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:04,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:31:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:04,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:04,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:04,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:04,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:04,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25700527] [2023-08-29 20:31:04,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25700527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:04,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:04,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:31:04,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621245500] [2023-08-29 20:31:04,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:04,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:31:04,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:04,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:31:04,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:31:04,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 274 [2023-08-29 20:31:04,241 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-29 20:31:04,241 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:04,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 274 [2023-08-29 20:31:04,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:04,399 INFO L130 PetriNetUnfolder]: 1121/1781 cut-off events. [2023-08-29 20:31:04,399 INFO L131 PetriNetUnfolder]: For 1081/1081 co-relation queries the response was YES. [2023-08-29 20:31:04,402 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-29 20:31:04,405 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 52 selfloop transitions, 2 changer transitions 11/68 dead transitions. [2023-08-29 20:31:04,405 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 424 flow [2023-08-29 20:31:04,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:31:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:31:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-29 20:31:04,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 20:31:04,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-29 20:31:04,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-29 20:31:04,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:04,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-29 20:31:04,407 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-29 20:31:04,408 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-29 20:31:04,408 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-29 20:31:04,408 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 158 flow. Second operand 3 states and 411 transitions. [2023-08-29 20:31:04,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 424 flow [2023-08-29 20:31:04,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 412 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:04,416 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 159 flow [2023-08-29 20:31:04,416 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-29 20:31:04,416 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-29 20:31:04,416 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 159 flow [2023-08-29 20:31:04,416 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-29 20:31:04,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:04,417 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-29 20:31:04,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:04,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:04,624 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-29 20:31:04,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash -611813848, now seen corresponding path program 2 times [2023-08-29 20:31:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:04,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1639199410] [2023-08-29 20:31:04,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:31:04,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:04,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:04,628 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:04,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:31:04,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:31:04,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:04,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:04,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:04,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:04,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:04,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1639199410] [2023-08-29 20:31:04,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1639199410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:04,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:04,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359573045] [2023-08-29 20:31:04,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:04,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:04,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:04,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:04,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:04,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 274 [2023-08-29 20:31:04,767 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-29 20:31:04,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:04,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 274 [2023-08-29 20:31:04,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:04,907 INFO L130 PetriNetUnfolder]: 648/1108 cut-off events. [2023-08-29 20:31:04,908 INFO L131 PetriNetUnfolder]: For 944/944 co-relation queries the response was YES. [2023-08-29 20:31:04,910 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-29 20:31:04,911 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 41 selfloop transitions, 1 changer transitions 31/76 dead transitions. [2023-08-29 20:31:04,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 471 flow [2023-08-29 20:31:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:31:04,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:31:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-08-29 20:31:04,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48905109489051096 [2023-08-29 20:31:04,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-08-29 20:31:04,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-08-29 20:31:04,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:04,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-08-29 20:31:04,914 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-29 20:31:04,915 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-29 20:31:04,915 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-29 20:31:04,915 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 159 flow. Second operand 4 states and 536 transitions. [2023-08-29 20:31:04,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 471 flow [2023-08-29 20:31:04,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 463 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:04,919 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 160 flow [2023-08-29 20:31:04,919 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-29 20:31:04,919 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-29 20:31:04,920 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 160 flow [2023-08-29 20:31:04,920 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-29 20:31:04,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:04,920 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-29 20:31:04,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:05,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:05,127 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-29 20:31:05,128 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1563064124, now seen corresponding path program 3 times [2023-08-29 20:31:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:05,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822700748] [2023-08-29 20:31:05,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:31:05,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:05,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:05,129 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:05,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:31:05,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:31:05,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:05,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-29 20:31:05,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:05,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:05,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822700748] [2023-08-29 20:31:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822700748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:05,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:05,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:31:05,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590843898] [2023-08-29 20:31:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:05,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:31:05,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:31:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:31:05,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-29 20:31:05,497 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-29 20:31:05,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:05,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-29 20:31:05,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:05,677 INFO L130 PetriNetUnfolder]: 705/1180 cut-off events. [2023-08-29 20:31:05,678 INFO L131 PetriNetUnfolder]: For 1078/1078 co-relation queries the response was YES. [2023-08-29 20:31:05,679 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-29 20:31:05,681 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 61 selfloop transitions, 6 changer transitions 11/81 dead transitions. [2023-08-29 20:31:05,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 514 flow [2023-08-29 20:31:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-29 20:31:05,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47737226277372263 [2023-08-29 20:31:05,683 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-29 20:31:05,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-29 20:31:05,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:05,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-29 20:31:05,684 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-29 20:31:05,685 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-29 20:31:05,686 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-29 20:31:05,686 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 160 flow. Second operand 5 states and 654 transitions. [2023-08-29 20:31:05,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 514 flow [2023-08-29 20:31:05,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 510 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:05,690 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 189 flow [2023-08-29 20:31:05,690 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-29 20:31:05,690 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-29 20:31:05,690 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 189 flow [2023-08-29 20:31:05,691 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-29 20:31:05,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:05,691 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-29 20:31:05,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:05,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:05,898 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-29 20:31:05,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:05,899 INFO L85 PathProgramCache]: Analyzing trace with hash 110891504, now seen corresponding path program 4 times [2023-08-29 20:31:05,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:05,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413906298] [2023-08-29 20:31:05,899 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:31:05,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:05,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:05,900 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:05,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:31:05,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:31:05,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:05,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 20:31:05,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:06,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:06,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:06,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413906298] [2023-08-29 20:31:06,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413906298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:06,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:06,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:31:06,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403252293] [2023-08-29 20:31:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:06,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:31:06,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:06,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:31:06,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:31:06,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 274 [2023-08-29 20:31:06,318 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-29 20:31:06,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:06,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 274 [2023-08-29 20:31:06,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:06,497 INFO L130 PetriNetUnfolder]: 733/1222 cut-off events. [2023-08-29 20:31:06,497 INFO L131 PetriNetUnfolder]: For 1524/1524 co-relation queries the response was YES. [2023-08-29 20:31:06,499 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-29 20:31:06,501 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 59 selfloop transitions, 6 changer transitions 14/82 dead transitions. [2023-08-29 20:31:06,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 545 flow [2023-08-29 20:31:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-29 20:31:06,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47737226277372263 [2023-08-29 20:31:06,503 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-29 20:31:06,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-29 20:31:06,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:06,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-29 20:31:06,505 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-29 20:31:06,506 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-29 20:31:06,506 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-29 20:31:06,506 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 189 flow. Second operand 5 states and 654 transitions. [2023-08-29 20:31:06,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 545 flow [2023-08-29 20:31:06,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:06,512 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 206 flow [2023-08-29 20:31:06,512 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-29 20:31:06,513 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-29 20:31:06,513 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 206 flow [2023-08-29 20:31:06,513 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-29 20:31:06,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:06,513 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-29 20:31:06,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:06,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:06,721 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-29 20:31:06,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:06,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1104484756, now seen corresponding path program 5 times [2023-08-29 20:31:06,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:06,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750312067] [2023-08-29 20:31:06,722 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:31:06,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:06,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:06,723 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:06,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:31:06,814 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:31:06,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:06,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:06,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:06,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:06,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750312067] [2023-08-29 20:31:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750312067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:06,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:06,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935993337] [2023-08-29 20:31:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:06,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:06,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:06,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:06,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:06,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 274 [2023-08-29 20:31:06,847 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-29 20:31:06,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:06,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 274 [2023-08-29 20:31:06,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:07,023 INFO L130 PetriNetUnfolder]: 1065/1777 cut-off events. [2023-08-29 20:31:07,024 INFO L131 PetriNetUnfolder]: For 2377/2391 co-relation queries the response was YES. [2023-08-29 20:31:07,027 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-29 20:31:07,029 INFO L137 encePairwiseOnDemand]: 271/274 looper letters, 34 selfloop transitions, 1 changer transitions 44/82 dead transitions. [2023-08-29 20:31:07,029 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 82 transitions, 571 flow [2023-08-29 20:31:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:31:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:31:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2023-08-29 20:31:07,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854014598540146 [2023-08-29 20:31:07,031 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2023-08-29 20:31:07,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2023-08-29 20:31:07,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:07,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2023-08-29 20:31:07,032 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-29 20:31:07,033 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-29 20:31:07,033 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-29 20:31:07,034 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 206 flow. Second operand 4 states and 532 transitions. [2023-08-29 20:31:07,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 82 transitions, 571 flow [2023-08-29 20:31:07,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:07,044 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 181 flow [2023-08-29 20:31:07,044 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-29 20:31:07,044 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2023-08-29 20:31:07,044 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 181 flow [2023-08-29 20:31:07,045 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-29 20:31:07,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:07,045 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-29 20:31:07,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:07,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:07,253 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-29 20:31:07,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1405050174, now seen corresponding path program 6 times [2023-08-29 20:31:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422587324] [2023-08-29 20:31:07,254 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-29 20:31:07,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:07,255 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:07,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-08-29 20:31:07,347 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-29 20:31:07,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:31:07,347 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:31:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:31:07,501 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:31:07,501 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:31:07,502 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:31:07,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:31:07,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:31:07,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:31:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:31:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:31:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:31:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:31:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:31:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:31:07,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:31:07,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:31:07,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:31:07,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:31:07,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:31:07,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:31:07,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:07,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:07,727 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:07,731 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:31:07,731 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:31:07,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:31:07 BasicIcfg [2023-08-29 20:31:07,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:31:07,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:31:07,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:31:07,774 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:31:07,774 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:50" (3/4) ... [2023-08-29 20:31:07,776 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:31:07,776 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:31:07,776 INFO L158 Benchmark]: Toolchain (without parser) took 18780.83ms. Allocated memory was 62.9MB in the beginning and 570.4MB in the end (delta: 507.5MB). Free memory was 28.6MB in the beginning and 298.1MB in the end (delta: -269.5MB). Peak memory consumption was 236.5MB. Max. memory is 16.1GB. [2023-08-29 20:31:07,776 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 62.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:07,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.38ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 28.5MB in the beginning and 38.5MB in the end (delta: -10.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-08-29 20:31:07,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.80ms. Allocated memory is still 79.7MB. Free memory was 38.5MB in the beginning and 57.1MB in the end (delta: -18.6MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2023-08-29 20:31:07,781 INFO L158 Benchmark]: Boogie Preprocessor took 33.91ms. Allocated memory is still 79.7MB. Free memory was 57.1MB in the beginning and 55.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:31:07,781 INFO L158 Benchmark]: RCFGBuilder took 620.23ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 55.1MB in the end (delta: -51.4kB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2023-08-29 20:31:07,782 INFO L158 Benchmark]: TraceAbstraction took 17588.28ms. Allocated memory was 79.7MB in the beginning and 570.4MB in the end (delta: 490.7MB). Free memory was 54.2MB in the beginning and 298.1MB in the end (delta: -243.9MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. [2023-08-29 20:31:07,784 INFO L158 Benchmark]: Witness Printer took 2.17ms. Allocated memory is still 570.4MB. Free memory is still 298.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:07,785 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 62.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.38ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 28.5MB in the beginning and 38.5MB in the end (delta: -10.1MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.80ms. Allocated memory is still 79.7MB. Free memory was 38.5MB in the beginning and 57.1MB in the end (delta: -18.6MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.91ms. Allocated memory is still 79.7MB. Free memory was 57.1MB in the beginning and 55.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 620.23ms. Allocated memory is still 79.7MB. Free memory was 55.0MB in the beginning and 55.1MB in the end (delta: -51.4kB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17588.28ms. Allocated memory was 79.7MB in the beginning and 570.4MB in the end (delta: 490.7MB). Free memory was 54.2MB in the beginning and 298.1MB in the end (delta: -243.9MB). Peak memory consumption was 245.6MB. Max. memory is 16.1GB. * Witness Printer took 2.17ms. Allocated memory is still 570.4MB. Free memory is still 298.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.7s, 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: 17.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 597 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 1.6s 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.2s 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.4s SatisfiabilityAnalysisTime, 1.2s 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-29 20:31:07,807 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