./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit


--------------------------------------------------------------------------------


Checking for memory safety (deref-memtrack)
Using default analysis
Version b8dbc81d
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-08-30 02:49:58,264 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-08-30 02:49:58,266 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-30 02:49:58,310 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-30 02:49:58,311 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-30 02:49:58,314 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-30 02:49:58,316 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-30 02:49:58,319 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-30 02:49:58,323 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-30 02:49:58,327 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-30 02:49:58,328 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-08-30 02:49:58,331 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-30 02:49:58,331 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-30 02:49:58,333 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-30 02:49:58,335 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-30 02:49:58,339 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-30 02:49:58,340 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-30 02:49:58,341 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-30 02:49:58,343 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-30 02:49:58,349 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-30 02:49:58,351 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-30 02:49:58,352 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-30 02:49:58,353 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-08-30 02:49:58,353 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-30 02:49:58,360 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-30 02:49:58,361 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-30 02:49:58,361 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-30 02:49:58,364 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-30 02:49:58,364 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-30 02:49:58,365 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-30 02:49:58,365 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-30 02:49:58,367 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-30 02:49:58,369 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-30 02:49:58,369 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-30 02:49:58,370 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-30 02:49:58,370 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-30 02:49:58,371 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-30 02:49:58,371 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-30 02:49:58,371 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-30 02:49:58,372 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-30 02:49:58,372 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-08-30 02:49:58,374 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-08-30 02:49:58,407 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-08-30 02:49:58,407 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-30 02:49:58,408 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-30 02:49:58,408 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-30 02:49:58,409 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-30 02:49:58,409 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-30 02:49:58,410 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-30 02:49:58,410 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-08-30 02:49:58,410 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-08-30 02:49:58,411 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-30 02:49:58,411 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-08-30 02:49:58,412 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-08-30 02:49:58,412 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-08-30 02:49:58,412 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-08-30 02:49:58,412 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-08-30 02:49:58,412 INFO  L138        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2023-08-30 02:49:58,413 INFO  L138        SettingsManager]:  * Bitprecise bitfields=true
[2023-08-30 02:49:58,413 INFO  L138        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2023-08-30 02:49:58,413 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-30 02:49:58,413 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-08-30 02:49:58,413 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-08-30 02:49:58,413 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-08-30 02:49:58,414 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-30 02:49:58,414 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-08-30 02:49:58,414 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-08-30 02:49:58,414 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 02:49:58,415 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-30 02:49:58,415 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-08-30 02:49:58,415 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-08-30 02:49:58,415 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-30 02:49:58,415 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-30 02:49:58,415 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-08-30 02:49:58,416 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-30 02:49:58,416 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-30 02:49:58,416 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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER
[2023-08-30 02:49:58,715 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-30 02:49:58,736 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-30 02:49:58,740 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-30 02:49:58,741 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-08-30 02:49:58,741 INFO  L275        PluginConnector]: CDTParser initialized
[2023-08-30 02:49:58,743 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i
[2023-08-30 02:49:59,864 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-08-30 02:50:00,166 INFO  L351              CDTParser]: Found 1 translation units.
[2023-08-30 02:50:00,173 INFO  L172              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i
[2023-08-30 02:50:00,194 INFO  L394              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b5ce259/bf75bc13529e4126bf9e3bcb75e7688e/FLAG61843038f
[2023-08-30 02:50:00,210 INFO  L402              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b5ce259/bf75bc13529e4126bf9e3bcb75e7688e
[2023-08-30 02:50:00,213 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-30 02:50:00,214 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-30 02:50:00,215 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-30 02:50:00,215 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-30 02:50:00,219 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-30 02:50:00,219 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,220 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd77e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00, skipping insertion in model container
[2023-08-30 02:50:00,220 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,226 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-08-30 02:50:00,278 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-08-30 02:50:00,440 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/mix026_power.opt_tso.opt.i[1001,1014]
[2023-08-30 02:50:00,589 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-30 02:50:00,605 INFO  L203         MainTranslator]: Completed pre-run
[2023-08-30 02:50:00,614 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/mix026_power.opt_tso.opt.i[1001,1014]
[2023-08-30 02:50:00,664 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-30 02:50:00,690 WARN  L667               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 02:50:00,690 WARN  L667               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 02:50:00,698 INFO  L208         MainTranslator]: Completed translation
[2023-08-30 02:50:00,707 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00 WrapperNode
[2023-08-30 02:50:00,708 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-30 02:50:00,709 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-30 02:50:00,709 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-30 02:50:00,709 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-30 02:50:00,715 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,748 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,770 INFO  L138                Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145
[2023-08-30 02:50:00,771 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-30 02:50:00,771 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-30 02:50:00,771 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-30 02:50:00,772 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-08-30 02:50:00,779 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,779 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,782 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,782 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,789 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,791 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,807 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,809 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,812 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-30 02:50:00,813 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-30 02:50:00,813 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-08-30 02:50:00,813 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-08-30 02:50:00,813 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (1/1) ...
[2023-08-30 02:50:00,826 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 02:50:00,837 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-30 02:50:00,848 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:00,850 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-08-30 02:50:00,872 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-08-30 02:50:00,872 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-30 02:50:00,872 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-30 02:50:00,872 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-30 02:50:00,872 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-30 02:50:00,873 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-08-30 02:50:00,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-08-30 02:50:00,873 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-08-30 02:50:00,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-08-30 02:50:00,873 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-08-30 02:50:00,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-08-30 02:50:00,874 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2023-08-30 02:50:00,874 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2023-08-30 02:50:00,874 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-30 02:50:00,874 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-30 02:50:00,874 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-30 02:50:00,874 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-30 02:50:00,875 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-30 02:50:01,023 INFO  L236             CfgBuilder]: Building ICFG
[2023-08-30 02:50:01,038 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-30 02:50:01,446 INFO  L277             CfgBuilder]: Performing block encoding
[2023-08-30 02:50:01,586 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-30 02:50:01,586 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-30 02:50:01,589 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:01 BoogieIcfgContainer
[2023-08-30 02:50:01,590 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-30 02:50:01,592 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-30 02:50:01,592 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-08-30 02:50:01,595 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-08-30 02:50:01,595 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:50:00" (1/3) ...
[2023-08-30 02:50:01,596 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674fd34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:01, skipping insertion in model container
[2023-08-30 02:50:01,596 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:00" (2/3) ...
[2023-08-30 02:50:01,597 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@674fd34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:01, skipping insertion in model container
[2023-08-30 02:50:01,597 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:01" (3/3) ...
[2023-08-30 02:50:01,598 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i
[2023-08-30 02:50:01,612 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-30 02:50:01,613 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations.
[2023-08-30 02:50:01,613 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-30 02:50:01,678 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-30 02:50:01,719 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow
[2023-08-30 02:50:01,789 INFO  L130       PetriNetUnfolder]: 2/138 cut-off events.
[2023-08-30 02:50:01,789 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:01,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. 
[2023-08-30 02:50:01,795 INFO  L82        GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow
[2023-08-30 02:50:01,799 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow
[2023-08-30 02:50:01,802 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-30 02:50:01,815 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow
[2023-08-30 02:50:01,819 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow
[2023-08-30 02:50:01,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow
[2023-08-30 02:50:01,875 INFO  L130       PetriNetUnfolder]: 2/138 cut-off events.
[2023-08-30 02:50:01,876 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:01,877 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. 
[2023-08-30 02:50:01,881 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3338
[2023-08-30 02:50:06,632 INFO  L134        LiptonReduction]: Checked pairs total: 10252
[2023-08-30 02:50:06,633 INFO  L136        LiptonReduction]: Total number of compositions: 127
[2023-08-30 02:50:06,645 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-30 02:50:06,650 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;@5d228eeb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-30 02:50:06,651 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2023-08-30 02:50:06,652 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-08-30 02:50:06,652 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:06,653 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:06,653 INFO  L208   CegarLoopForPetriNet]: trace histogram [1]
[2023-08-30 02:50:06,654 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:06,658 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:06,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 588, now seen corresponding path program 1 times
[2023-08-30 02:50:06,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:06,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479364514]
[2023-08-30 02:50:06,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:06,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:06,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:06,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:06,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:06,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479364514]
[2023-08-30 02:50:06,755 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479364514] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:06,755 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:06,755 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-30 02:50:06,757 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783425028]
[2023-08-30 02:50:06,757 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:06,763 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-30 02:50:06,767 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:06,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-30 02:50:06,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-30 02:50:06,786 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 269
[2023-08-30 02:50:06,788 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:06,788 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:06,788 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 269
[2023-08-30 02:50:06,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:08,076 INFO  L130       PetriNetUnfolder]: 6949/9657 cut-off events.
[2023-08-30 02:50:08,076 INFO  L131       PetriNetUnfolder]: For 43/43 co-relation queries the response was YES.
[2023-08-30 02:50:08,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19271 conditions, 9657 events. 6949/9657 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 51215 event pairs, 6949 based on Foata normal form. 0/8265 useless extension candidates. Maximal degree in co-relation 19259. Up to 9399 conditions per place. 
[2023-08-30 02:50:08,145 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions.
[2023-08-30 02:50:08,145 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow
[2023-08-30 02:50:08,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-08-30 02:50:08,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-30 02:50:08,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions.
[2023-08-30 02:50:08,162 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5427509293680297
[2023-08-30 02:50:08,163 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 292 transitions.
[2023-08-30 02:50:08,164 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions.
[2023-08-30 02:50:08,166 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:08,168 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions.
[2023-08-30 02:50:08,174 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:08,178 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:08,178 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:08,180 INFO  L175             Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 292 transitions.
[2023-08-30 02:50:08,180 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow
[2023-08-30 02:50:08,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-08-30 02:50:08,189 INFO  L231             Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow
[2023-08-30 02:50:08,191 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31}
[2023-08-30 02:50:08,195 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places.
[2023-08-30 02:50:08,195 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow
[2023-08-30 02:50:08,195 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:08,196 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:08,196 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-08-30 02:50:08,198 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-30 02:50:08,199 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:08,207 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:08,208 INFO  L85        PathProgramCache]: Analyzing trace with hash 554353151, now seen corresponding path program 1 times
[2023-08-30 02:50:08,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:08,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164410869]
[2023-08-30 02:50:08,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:08,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:08,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:08,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:08,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:08,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164410869]
[2023-08-30 02:50:08,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164410869] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:08,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:08,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-30 02:50:08,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212581357]
[2023-08-30 02:50:08,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:08,509 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-30 02:50:08,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:08,510 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-30 02:50:08,510 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-30 02:50:08,513 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 127 out of 269
[2023-08-30 02:50:08,514 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:08,514 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:08,514 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 269
[2023-08-30 02:50:08,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:09,378 INFO  L130       PetriNetUnfolder]: 5463/7964 cut-off events.
[2023-08-30 02:50:09,379 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:09,387 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15561 conditions, 7964 events. 5463/7964 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 47069 event pairs, 1005 based on Foata normal form. 0/7380 useless extension candidates. Maximal degree in co-relation 15558. Up to 5923 conditions per place. 
[2023-08-30 02:50:09,424 INFO  L137   encePairwiseOnDemand]: 266/269 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions.
[2023-08-30 02:50:09,424 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow
[2023-08-30 02:50:09,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-30 02:50:09,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-30 02:50:09,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions.
[2023-08-30 02:50:09,427 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5291201982651796
[2023-08-30 02:50:09,427 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 427 transitions.
[2023-08-30 02:50:09,427 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions.
[2023-08-30 02:50:09,427 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:09,428 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions.
[2023-08-30 02:50:09,429 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:09,432 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:09,433 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:09,433 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 427 transitions.
[2023-08-30 02:50:09,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow
[2023-08-30 02:50:09,434 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-30 02:50:09,435 INFO  L231             Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow
[2023-08-30 02:50:09,435 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, 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=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29}
[2023-08-30 02:50:09,436 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places.
[2023-08-30 02:50:09,436 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow
[2023-08-30 02:50:09,436 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:09,436 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:09,437 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:09,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-30 02:50:09,437 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:09,440 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:09,440 INFO  L85        PathProgramCache]: Analyzing trace with hash -1600369706, now seen corresponding path program 1 times
[2023-08-30 02:50:09,440 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:09,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407289612]
[2023-08-30 02:50:09,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:09,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:09,507 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:09,795 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:09,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:09,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407289612]
[2023-08-30 02:50:09,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407289612] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:09,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:09,797 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-30 02:50:09,797 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244596832]
[2023-08-30 02:50:09,797 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:09,797 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-30 02:50:09,798 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:09,798 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-30 02:50:09,798 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-30 02:50:09,814 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 269
[2023-08-30 02:50:09,815 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:09,815 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:09,816 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 269
[2023-08-30 02:50:09,816 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:11,855 INFO  L130       PetriNetUnfolder]: 18481/24958 cut-off events.
[2023-08-30 02:50:11,856 INFO  L131       PetriNetUnfolder]: For 1252/1252 co-relation queries the response was YES.
[2023-08-30 02:50:11,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51521 conditions, 24958 events. 18481/24958 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 131952 event pairs, 6623 based on Foata normal form. 0/24378 useless extension candidates. Maximal degree in co-relation 51517. Up to 15811 conditions per place. 
[2023-08-30 02:50:11,963 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 47 selfloop transitions, 8 changer transitions 0/55 dead transitions.
[2023-08-30 02:50:11,963 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 240 flow
[2023-08-30 02:50:11,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-30 02:50:11,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-30 02:50:11,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions.
[2023-08-30 02:50:11,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5080545229244114
[2023-08-30 02:50:11,965 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 410 transitions.
[2023-08-30 02:50:11,965 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions.
[2023-08-30 02:50:11,966 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:11,966 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions.
[2023-08-30 02:50:11,967 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:11,968 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:11,969 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:11,969 INFO  L175             Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 410 transitions.
[2023-08-30 02:50:11,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 240 flow
[2023-08-30 02:50:11,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:11,972 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow
[2023-08-30 02:50:11,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2023-08-30 02:50:11,974 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places.
[2023-08-30 02:50:11,977 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow
[2023-08-30 02:50:11,977 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:11,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:11,978 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:11,978 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-30 02:50:11,978 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:11,978 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:11,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 1928145471, now seen corresponding path program 1 times
[2023-08-30 02:50:11,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:11,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586596994]
[2023-08-30 02:50:11,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:11,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:12,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:12,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:12,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:12,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586596994]
[2023-08-30 02:50:12,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586596994] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:12,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:12,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-30 02:50:12,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338222189]
[2023-08-30 02:50:12,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:12,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-30 02:50:12,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:12,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-30 02:50:12,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-30 02:50:12,223 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 269
[2023-08-30 02:50:12,224 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand  has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:12,226 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:12,226 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 269
[2023-08-30 02:50:12,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:14,116 INFO  L130       PetriNetUnfolder]: 14318/20164 cut-off events.
[2023-08-30 02:50:14,117 INFO  L131       PetriNetUnfolder]: For 6984/7043 co-relation queries the response was YES.
[2023-08-30 02:50:14,174 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48131 conditions, 20164 events. 14318/20164 cut-off events. For 6984/7043 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 116554 event pairs, 4738 based on Foata normal form. 188/20115 useless extension candidates. Maximal degree in co-relation 48126. Up to 12438 conditions per place. 
[2023-08-30 02:50:14,277 INFO  L137   encePairwiseOnDemand]: 266/269 looper letters, 42 selfloop transitions, 3 changer transitions 0/51 dead transitions.
[2023-08-30 02:50:14,278 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 260 flow
[2023-08-30 02:50:14,278 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-30 02:50:14,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-30 02:50:14,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions.
[2023-08-30 02:50:14,280 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5179677819083024
[2023-08-30 02:50:14,280 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 418 transitions.
[2023-08-30 02:50:14,280 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions.
[2023-08-30 02:50:14,281 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:14,281 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions.
[2023-08-30 02:50:14,282 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:14,283 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:14,284 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:14,285 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 3 states and 418 transitions.
[2023-08-30 02:50:14,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 260 flow
[2023-08-30 02:50:14,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:14,320 INFO  L231             Difference]: Finished difference. Result has 44 places, 36 transitions, 123 flow
[2023-08-30 02:50:14,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=44, PETRI_TRANSITIONS=36}
[2023-08-30 02:50:14,322 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places.
[2023-08-30 02:50:14,322 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 123 flow
[2023-08-30 02:50:14,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:14,323 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:14,323 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:14,323 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-30 02:50:14,324 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:14,324 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:14,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 1928147263, now seen corresponding path program 1 times
[2023-08-30 02:50:14,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:14,324 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641267505]
[2023-08-30 02:50:14,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:14,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:14,368 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:14,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:14,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:14,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641267505]
[2023-08-30 02:50:14,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641267505] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:14,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:14,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 02:50:14,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999434695]
[2023-08-30 02:50:14,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:14,975 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-30 02:50:14,975 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:14,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-30 02:50:14,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2023-08-30 02:50:15,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 269
[2023-08-30 02:50:15,182 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 123 flow. Second operand  has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:15,183 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:15,183 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 269
[2023-08-30 02:50:15,183 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:15,868 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 122#L770true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 140#$Ultimate##0true, 156#true, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse])
[2023-08-30 02:50:15,869 INFO  L383   tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,869 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,869 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 140#$Ultimate##0true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 142#L845true])
[2023-08-30 02:50:15,869 INFO  L383   tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,870 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,870 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,870 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,870 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [122#L770true, Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 27#L866-3true, 140#$Ultimate##0true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 169#true, P2Thread1of1ForFork1InUse])
[2023-08-30 02:50:15,870 INFO  L383   tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,870 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,871 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 140#$Ultimate##0true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 89#L4true, 142#L845true])
[2023-08-30 02:50:15,872 INFO  L383   tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:15,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 19 ancestors and is cut-off event
[2023-08-30 02:50:16,005 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 122#L770true, 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 156#true, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse])
[2023-08-30 02:50:16,005 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,005 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 142#L845true])
[2023-08-30 02:50:16,006 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [122#L770true, Black: 163#true, 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 27#L866-3true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 169#true, P2Thread1of1ForFork1InUse])
[2023-08-30 02:50:16,006 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,006 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,007 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 142#L845true, 89#L4true])
[2023-08-30 02:50:16,007 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,007 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,007 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,007 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,016 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 140#$Ultimate##0true, 156#true, P1Thread1of1ForFork2InUse, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 127#P0EXITtrue])
[2023-08-30 02:50:16,017 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 140#$Ultimate##0true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 127#P0EXITtrue, 142#L845true])
[2023-08-30 02:50:16,017 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,017 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 27#L866-3true, 140#$Ultimate##0true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 169#true, P2Thread1of1ForFork1InUse, 127#P0EXITtrue])
[2023-08-30 02:50:16,017 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,018 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,018 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,018 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,018 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 140#$Ultimate##0true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue, 89#L4true, 142#L845true])
[2023-08-30 02:50:16,018 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,018 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,018 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,018 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 140#$Ultimate##0true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue])
[2023-08-30 02:50:16,019 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 140#$Ultimate##0true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 142#L845true])
[2023-08-30 02:50:16,019 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,019 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [122#L770true, Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 27#L866-3true, 140#$Ultimate##0true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue])
[2023-08-30 02:50:16,019 INFO  L383   tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,020 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,020 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,020 INFO  L386   tUnfolder$Statistics]:   existing Event has 20 ancestors and is cut-off event
[2023-08-30 02:50:16,157 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 156#true, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 127#P0EXITtrue])
[2023-08-30 02:50:16,157 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,158 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 127#P0EXITtrue, 142#L845true])
[2023-08-30 02:50:16,158 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,158 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,158 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,158 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,158 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [Black: 163#true, 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 146#L822true, 27#L866-3true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 169#true, P2Thread1of1ForFork1InUse, 127#P0EXITtrue])
[2023-08-30 02:50:16,158 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,159 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue, 142#L845true, 89#L4true])
[2023-08-30 02:50:16,160 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 122#L770true, 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue])
[2023-08-30 02:50:16,161 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 142#L845true])
[2023-08-30 02:50:16,161 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,161 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,162 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [122#L770true, 79#L792true, Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 27#L866-3true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue])
[2023-08-30 02:50:16,162 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,162 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,162 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,162 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,170 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 140#$Ultimate##0true, 156#true, P1Thread1of1ForFork2InUse, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue])
[2023-08-30 02:50:16,170 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,170 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,170 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,170 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,170 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 140#$Ultimate##0true, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue, 142#L845true])
[2023-08-30 02:50:16,171 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,171 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 27#L866-3true, 140#$Ultimate##0true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue])
[2023-08-30 02:50:16,171 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:16,277 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, 141#L795true, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue])
[2023-08-30 02:50:16,277 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,277 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,277 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,277 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,278 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, 141#L795true, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 142#L845true])
[2023-08-30 02:50:16,278 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,285 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue])
[2023-08-30 02:50:16,286 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,286 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 79#L792true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue, 142#L845true])
[2023-08-30 02:50:16,286 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,287 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [79#L792true, Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 27#L866-3true, 156#true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 78#L838true, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue])
[2023-08-30 02:50:16,287 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:16,335 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [122#L770true, Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 27#L866-3true, 156#true, P1Thread1of1ForFork2InUse, 141#L795true, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue])
[2023-08-30 02:50:16,335 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event
[2023-08-30 02:50:16,335 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is not cut-off event
[2023-08-30 02:50:16,335 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is not cut-off event
[2023-08-30 02:50:16,335 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is not cut-off event
[2023-08-30 02:50:16,376 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][51], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, P1Thread1of1ForFork2InUse, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 141#L795true, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue])
[2023-08-30 02:50:16,377 INFO  L383   tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,377 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,377 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,377 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,378 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][52], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), P1Thread1of1ForFork2InUse, 141#L795true, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue, 142#L845true])
[2023-08-30 02:50:16,378 INFO  L383   tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,378 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:16,401 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([543] L880-->L866-3: Formula: (and (= |v_ULTIMATE.start_main_#res#1_30| 0) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_18 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (not (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 2 v_~__unbuffered_p3_EAX~0_18) (= 0 v_~__unbuffered_p3_EBX~0_18) (= v_~__unbuffered_p0_EAX~0_26 0) (= v_~z~0_22 2))) 1 0) 0) 0 1)) (= |v_#valid_182| (store (store (store |v_#valid_183| |v_ULTIMATE.start_main_~#t685~0#1.base_43| 0) |v_ULTIMATE.start_main_~#t686~0#1.base_33| 0) |v_ULTIMATE.start_main_~#t687~0#1.base_44| 0)))  InVars {ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_~#t686~0#1.base=|v_ULTIMATE.start_main_~#t686~0#1.base_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_183|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ULTIMATE.start_main_~#t685~0#1.base=|v_ULTIMATE.start_main_~#t685~0#1.base_43|, ~z~0=v_~z~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18}  OutVars{ULTIMATE.start_main_~#t687~0#1.base=|v_ULTIMATE.start_main_~#t687~0#1.base_44|, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_25|, ULTIMATE.start_main_~#t685~0#1.offset=|v_ULTIMATE.start_main_~#t685~0#1.offset_31|, ULTIMATE.start_main_~#t686~0#1.offset=|v_ULTIMATE.start_main_~#t686~0#1.offset_25|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, #valid=|v_#valid_182|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_18, ~z~0=v_~z~0_22}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t685~0#1.offset, ULTIMATE.start_main_~#t686~0#1.base, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_~#t686~0#1.offset, ULTIMATE.start_main_#res#1, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t685~0#1.base][49], [Black: 163#true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 27#L866-3true, 156#true, P1Thread1of1ForFork2InUse, 141#L795true, P3Thread1of1ForFork3InUse, 78#L838true, 180#(= |ULTIMATE.start_main_old_#valid#1| (store |#valid| |ULTIMATE.start_main_~#t688~0#1.base| 0)), P0Thread1of1ForFork0InUse, 169#true, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue])
[2023-08-30 02:50:16,402 INFO  L383   tUnfolder$Statistics]: this new event has 23 ancestors and is not cut-off event
[2023-08-30 02:50:16,402 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is not cut-off event
[2023-08-30 02:50:16,402 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is not cut-off event
[2023-08-30 02:50:16,402 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is not cut-off event
[2023-08-30 02:50:16,491 INFO  L130       PetriNetUnfolder]: 10566/15022 cut-off events.
[2023-08-30 02:50:16,492 INFO  L131       PetriNetUnfolder]: For 3794/4366 co-relation queries the response was YES.
[2023-08-30 02:50:16,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35212 conditions, 15022 events. 10566/15022 cut-off events. For 3794/4366 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 88261 event pairs, 2681 based on Foata normal form. 846/15148 useless extension candidates. Maximal degree in co-relation 35206. Up to 9529 conditions per place. 
[2023-08-30 02:50:16,600 INFO  L137   encePairwiseOnDemand]: 263/269 looper letters, 41 selfloop transitions, 4 changer transitions 16/69 dead transitions.
[2023-08-30 02:50:16,601 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 329 flow
[2023-08-30 02:50:16,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-08-30 02:50:16,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 02:50:16,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions.
[2023-08-30 02:50:16,608 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43441317047265005
[2023-08-30 02:50:16,608 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 818 transitions.
[2023-08-30 02:50:16,609 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions.
[2023-08-30 02:50:16,609 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:16,609 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions.
[2023-08-30 02:50:16,614 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:16,619 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:16,620 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:16,620 INFO  L175             Difference]: Start difference. First operand has 44 places, 36 transitions, 123 flow. Second operand 7 states and 818 transitions.
[2023-08-30 02:50:16,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 329 flow
[2023-08-30 02:50:16,637 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 69 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:16,638 INFO  L231             Difference]: Finished difference. Result has 47 places, 33 transitions, 115 flow
[2023-08-30 02:50:16,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=33}
[2023-08-30 02:50:16,639 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places.
[2023-08-30 02:50:16,639 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 115 flow
[2023-08-30 02:50:16,640 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:16,640 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:16,640 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:16,640 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-30 02:50:16,640 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:16,641 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:16,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -395235596, now seen corresponding path program 1 times
[2023-08-30 02:50:16,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:16,641 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300747013]
[2023-08-30 02:50:16,641 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:16,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:16,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:16,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:16,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:16,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300747013]
[2023-08-30 02:50:16,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300747013] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:16,853 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:16,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 02:50:16,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907777969]
[2023-08-30 02:50:16,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:16,854 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 02:50:16,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:16,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 02:50:16,859 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 02:50:16,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 269
[2023-08-30 02:50:16,877 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 115 flow. Second operand  has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:16,877 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:16,877 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 269
[2023-08-30 02:50:16,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:17,531 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 182#true, P1Thread1of1ForFork2InUse, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 141#L795true, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 142#L845true, 89#L4true])
[2023-08-30 02:50:17,531 INFO  L383   tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-08-30 02:50:17,531 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:17,531 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:17,531 INFO  L386   tUnfolder$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-08-30 02:50:17,590 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 182#true, P1Thread1of1ForFork2InUse, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 141#L795true, P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue, 89#L4true, 142#L845true])
[2023-08-30 02:50:17,590 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,591 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][74], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 122#L770true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), 182#true, P1Thread1of1ForFork2InUse, 156#true, 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 141#L795true, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 19#P2EXITtrue])
[2023-08-30 02:50:17,591 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,592 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [122#L770true, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 182#true, P1Thread1of1ForFork2InUse, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 141#L795true, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 142#L845true])
[2023-08-30 02:50:17,592 INFO  L383   tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-08-30 02:50:17,632 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][74], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 182#true, P1Thread1of1ForFork2InUse, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 141#L795true, P3Thread1of1ForFork3InUse, 78#L838true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue])
[2023-08-30 02:50:17,632 INFO  L383   tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,632 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,633 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([419] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93)))))  InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100}  OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99}  AuxVars[]  AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][70], [Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 182#true, P1Thread1of1ForFork2InUse, 156#true, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 141#L795true, P3Thread1of1ForFork3InUse, 39#L880true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, 127#P0EXITtrue, 142#L845true])
[2023-08-30 02:50:17,633 INFO  L383   tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,633 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,633 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,633 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:17,672 INFO  L130       PetriNetUnfolder]: 6617/9764 cut-off events.
[2023-08-30 02:50:17,672 INFO  L131       PetriNetUnfolder]: For 1925/2059 co-relation queries the response was YES.
[2023-08-30 02:50:17,684 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22031 conditions, 9764 events. 6617/9764 cut-off events. For 1925/2059 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 58432 event pairs, 1248 based on Foata normal form. 723/10133 useless extension candidates. Maximal degree in co-relation 22025. Up to 6203 conditions per place. 
[2023-08-30 02:50:17,709 INFO  L137   encePairwiseOnDemand]: 262/269 looper letters, 64 selfloop transitions, 10 changer transitions 0/82 dead transitions.
[2023-08-30 02:50:17,709 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 397 flow
[2023-08-30 02:50:17,710 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-30 02:50:17,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 02:50:17,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions.
[2023-08-30 02:50:17,712 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4929368029739777
[2023-08-30 02:50:17,712 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 663 transitions.
[2023-08-30 02:50:17,712 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions.
[2023-08-30 02:50:17,713 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:17,713 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions.
[2023-08-30 02:50:17,714 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:17,718 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:17,719 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:17,719 INFO  L175             Difference]: Start difference. First operand has 47 places, 33 transitions, 115 flow. Second operand 5 states and 663 transitions.
[2023-08-30 02:50:17,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 397 flow
[2023-08-30 02:50:17,722 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 385 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-08-30 02:50:17,723 INFO  L231             Difference]: Finished difference. Result has 48 places, 42 transitions, 183 flow
[2023-08-30 02:50:17,724 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=48, PETRI_TRANSITIONS=42}
[2023-08-30 02:50:17,727 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -4 predicate places.
[2023-08-30 02:50:17,727 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 183 flow
[2023-08-30 02:50:17,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 122.0) internal successors, (488), 4 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:17,727 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:17,727 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:17,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-08-30 02:50:17,728 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:17,728 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:17,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 1914136093, now seen corresponding path program 1 times
[2023-08-30 02:50:17,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:17,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206801099]
[2023-08-30 02:50:17,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:17,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:17,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:18,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:18,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:18,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206801099]
[2023-08-30 02:50:18,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206801099] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:18,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:18,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-30 02:50:18,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898914886]
[2023-08-30 02:50:18,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:18,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-08-30 02:50:18,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:18,362 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-08-30 02:50:18,362 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2023-08-30 02:50:18,409 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 269
[2023-08-30 02:50:18,410 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 183 flow. Second operand  has 8 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:18,410 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:18,410 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 269
[2023-08-30 02:50:18,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:20,073 INFO  L130       PetriNetUnfolder]: 12255/18253 cut-off events.
[2023-08-30 02:50:20,073 INFO  L131       PetriNetUnfolder]: For 12859/13236 co-relation queries the response was YES.
[2023-08-30 02:50:20,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53610 conditions, 18253 events. 12255/18253 cut-off events. For 12859/13236 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 121177 event pairs, 1940 based on Foata normal form. 291/18277 useless extension candidates. Maximal degree in co-relation 53601. Up to 9238 conditions per place. 
[2023-08-30 02:50:20,146 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 118 selfloop transitions, 22 changer transitions 45/191 dead transitions.
[2023-08-30 02:50:20,147 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 191 transitions, 1216 flow
[2023-08-30 02:50:20,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-08-30 02:50:20,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-30 02:50:20,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1217 transitions.
[2023-08-30 02:50:20,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5026848409748038
[2023-08-30 02:50:20,150 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1217 transitions.
[2023-08-30 02:50:20,150 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1217 transitions.
[2023-08-30 02:50:20,151 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:20,151 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1217 transitions.
[2023-08-30 02:50:20,154 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 135.22222222222223) internal successors, (1217), 9 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:20,157 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:20,158 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:20,158 INFO  L175             Difference]: Start difference. First operand has 48 places, 42 transitions, 183 flow. Second operand 9 states and 1217 transitions.
[2023-08-30 02:50:20,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 191 transitions, 1216 flow
[2023-08-30 02:50:20,194 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 191 transitions, 1191 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-30 02:50:20,195 INFO  L231             Difference]: Finished difference. Result has 62 places, 61 transitions, 351 flow
[2023-08-30 02:50:20,196 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=351, PETRI_PLACES=62, PETRI_TRANSITIONS=61}
[2023-08-30 02:50:20,196 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places.
[2023-08-30 02:50:20,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 351 flow
[2023-08-30 02:50:20,197 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:20,197 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:20,197 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:20,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-08-30 02:50:20,197 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:20,198 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:20,198 INFO  L85        PathProgramCache]: Analyzing trace with hash 11087910, now seen corresponding path program 1 times
[2023-08-30 02:50:20,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:20,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71417284]
[2023-08-30 02:50:20,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:20,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:20,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:20,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:20,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:20,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71417284]
[2023-08-30 02:50:20,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71417284] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:20,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:20,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 02:50:20,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942452162]
[2023-08-30 02:50:20,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:20,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 02:50:20,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:20,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 02:50:20,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-30 02:50:20,413 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 269
[2023-08-30 02:50:20,414 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 351 flow. Second operand  has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:20,414 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:20,414 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 269
[2023-08-30 02:50:20,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:21,667 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([541] L880-->ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_21| 0) (= (ite (= (ite (not (and (= v_~z~0_18 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 2 v_~__unbuffered_p3_EAX~0_14) (= 0 v_~__unbuffered_p3_EBX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_14) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_9|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_14}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][186], [192#true, Black: 201#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= 0 ~x$r_buff0_thd0~0)), Black: 205#(and (not (= 0 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0) (= ~x~0 0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~a~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), 214#true, Black: 194#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 195#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~a~0 1) (= 0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 199#(not (= ~__unbuffered_p3_EBX~0 0)), 156#true, P1Thread1of1ForFork2InUse, Black: 197#(and (not (= 0 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~a~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), Black: 203#(and (not (= 0 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~__unbuffered_p3_EBX~0 ~x$w_buff0~0) (= ~a~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0)), P3Thread1of1ForFork3InUse, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 19#P2EXITtrue, Black: 165#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), 74#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 179#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 141#L795true, 78#L838true, 127#P0EXITtrue, Black: 185#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 187#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), Black: 184#(= ~__unbuffered_cnt~0 0)])
[2023-08-30 02:50:21,667 INFO  L383   tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-08-30 02:50:21,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:21,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:21,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-08-30 02:50:21,748 INFO  L130       PetriNetUnfolder]: 8480/12927 cut-off events.
[2023-08-30 02:50:21,749 INFO  L131       PetriNetUnfolder]: For 31953/32153 co-relation queries the response was YES.
[2023-08-30 02:50:21,775 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51431 conditions, 12927 events. 8480/12927 cut-off events. For 31953/32153 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 86424 event pairs, 623 based on Foata normal form. 877/13426 useless extension candidates. Maximal degree in co-relation 51415. Up to 4185 conditions per place. 
[2023-08-30 02:50:21,811 INFO  L137   encePairwiseOnDemand]: 262/269 looper letters, 167 selfloop transitions, 17 changer transitions 19/215 dead transitions.
[2023-08-30 02:50:21,812 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 215 transitions, 1647 flow
[2023-08-30 02:50:21,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-08-30 02:50:21,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 02:50:21,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 928 transitions.
[2023-08-30 02:50:21,816 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4928305894848646
[2023-08-30 02:50:21,816 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 928 transitions.
[2023-08-30 02:50:21,816 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 928 transitions.
[2023-08-30 02:50:21,817 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:21,817 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 928 transitions.
[2023-08-30 02:50:21,819 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 132.57142857142858) internal successors, (928), 7 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:21,822 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:21,822 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:21,822 INFO  L175             Difference]: Start difference. First operand has 62 places, 61 transitions, 351 flow. Second operand 7 states and 928 transitions.
[2023-08-30 02:50:21,822 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 215 transitions, 1647 flow
[2023-08-30 02:50:21,877 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 215 transitions, 1647 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-30 02:50:21,880 INFO  L231             Difference]: Finished difference. Result has 71 places, 70 transitions, 479 flow
[2023-08-30 02:50:21,880 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=71, PETRI_TRANSITIONS=70}
[2023-08-30 02:50:21,883 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places.
[2023-08-30 02:50:21,883 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 479 flow
[2023-08-30 02:50:21,883 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:21,883 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:21,883 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:21,884 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-08-30 02:50:21,884 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:21,884 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:21,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -1555584601, now seen corresponding path program 1 times
[2023-08-30 02:50:21,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:21,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565670644]
[2023-08-30 02:50:21,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:21,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:21,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:22,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:22,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:22,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565670644]
[2023-08-30 02:50:22,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565670644] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:22,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:22,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 02:50:22,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807483008]
[2023-08-30 02:50:22,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:22,508 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 02:50:22,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:22,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 02:50:22,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-30 02:50:22,588 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 114 out of 269
[2023-08-30 02:50:22,589 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 479 flow. Second operand  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:22,589 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:22,589 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 269
[2023-08-30 02:50:22,589 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:25,172 INFO  L130       PetriNetUnfolder]: 16713/24965 cut-off events.
[2023-08-30 02:50:25,172 INFO  L131       PetriNetUnfolder]: For 81186/81186 co-relation queries the response was YES.
[2023-08-30 02:50:25,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 112677 conditions, 24965 events. 16713/24965 cut-off events. For 81186/81186 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 165926 event pairs, 948 based on Foata normal form. 41/25006 useless extension candidates. Maximal degree in co-relation 112657. Up to 8748 conditions per place. 
[2023-08-30 02:50:25,312 INFO  L137   encePairwiseOnDemand]: 256/269 looper letters, 194 selfloop transitions, 60 changer transitions 85/339 dead transitions.
[2023-08-30 02:50:25,313 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 339 transitions, 3086 flow
[2023-08-30 02:50:25,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-08-30 02:50:25,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-30 02:50:25,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1192 transitions.
[2023-08-30 02:50:25,316 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4923585295332507
[2023-08-30 02:50:25,317 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1192 transitions.
[2023-08-30 02:50:25,317 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1192 transitions.
[2023-08-30 02:50:25,318 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:25,318 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1192 transitions.
[2023-08-30 02:50:25,320 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 132.44444444444446) internal successors, (1192), 9 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:25,323 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:25,324 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:25,324 INFO  L175             Difference]: Start difference. First operand has 71 places, 70 transitions, 479 flow. Second operand 9 states and 1192 transitions.
[2023-08-30 02:50:25,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 339 transitions, 3086 flow
[2023-08-30 02:50:26,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 339 transitions, 2756 flow, removed 120 selfloop flow, removed 3 redundant places.
[2023-08-30 02:50:26,674 INFO  L231             Difference]: Finished difference. Result has 81 places, 106 transitions, 935 flow
[2023-08-30 02:50:26,675 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=935, PETRI_PLACES=81, PETRI_TRANSITIONS=106}
[2023-08-30 02:50:26,675 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places.
[2023-08-30 02:50:26,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 106 transitions, 935 flow
[2023-08-30 02:50:26,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:26,676 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:26,676 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:26,677 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-08-30 02:50:26,677 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:26,677 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:26,677 INFO  L85        PathProgramCache]: Analyzing trace with hash 1645314464, now seen corresponding path program 1 times
[2023-08-30 02:50:26,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:26,678 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223979158]
[2023-08-30 02:50:26,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:26,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:26,723 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:26,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:26,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:26,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223979158]
[2023-08-30 02:50:26,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223979158] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:26,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:26,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 02:50:26,946 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145958768]
[2023-08-30 02:50:26,946 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:26,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 02:50:26,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:26,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 02:50:26,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-30 02:50:26,968 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 269
[2023-08-30 02:50:26,969 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 106 transitions, 935 flow. Second operand  has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:26,970 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:26,970 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 269
[2023-08-30 02:50:26,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:28,221 INFO  L130       PetriNetUnfolder]: 5422/8833 cut-off events.
[2023-08-30 02:50:28,221 INFO  L131       PetriNetUnfolder]: For 62145/62740 co-relation queries the response was YES.
[2023-08-30 02:50:28,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44523 conditions, 8833 events. 5422/8833 cut-off events. For 62145/62740 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 59248 event pairs, 407 based on Foata normal form. 992/9677 useless extension candidates. Maximal degree in co-relation 44498. Up to 2628 conditions per place. 
[2023-08-30 02:50:28,269 INFO  L137   encePairwiseOnDemand]: 262/269 looper letters, 211 selfloop transitions, 18 changer transitions 57/311 dead transitions.
[2023-08-30 02:50:28,269 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 311 transitions, 3388 flow
[2023-08-30 02:50:28,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-08-30 02:50:28,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 02:50:28,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 931 transitions.
[2023-08-30 02:50:28,272 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4944237918215613
[2023-08-30 02:50:28,272 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 931 transitions.
[2023-08-30 02:50:28,272 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 931 transitions.
[2023-08-30 02:50:28,273 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:28,273 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 931 transitions.
[2023-08-30 02:50:28,275 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:28,277 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:28,278 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:28,278 INFO  L175             Difference]: Start difference. First operand has 81 places, 106 transitions, 935 flow. Second operand 7 states and 931 transitions.
[2023-08-30 02:50:28,278 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 311 transitions, 3388 flow
[2023-08-30 02:50:28,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 311 transitions, 3216 flow, removed 86 selfloop flow, removed 3 redundant places.
[2023-08-30 02:50:28,409 INFO  L231             Difference]: Finished difference. Result has 83 places, 106 transitions, 937 flow
[2023-08-30 02:50:28,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=937, PETRI_PLACES=83, PETRI_TRANSITIONS=106}
[2023-08-30 02:50:28,409 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places.
[2023-08-30 02:50:28,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 937 flow
[2023-08-30 02:50:28,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:28,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:28,410 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]
[2023-08-30 02:50:28,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-08-30 02:50:28,411 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:28,411 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:28,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 1888594791, now seen corresponding path program 1 times
[2023-08-30 02:50:28,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:28,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799252047]
[2023-08-30 02:50:28,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:28,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:28,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:28,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:28,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:28,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799252047]
[2023-08-30 02:50:28,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799252047] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:28,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:28,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 02:50:28,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636814329]
[2023-08-30 02:50:28,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:28,631 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 02:50:28,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:28,632 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 02:50:28,632 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 02:50:28,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 269
[2023-08-30 02:50:28,639 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 106 transitions, 937 flow. Second operand  has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:28,639 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:28,639 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 269
[2023-08-30 02:50:28,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:30,357 INFO  L130       PetriNetUnfolder]: 7804/12867 cut-off events.
[2023-08-30 02:50:30,357 INFO  L131       PetriNetUnfolder]: For 68876/69206 co-relation queries the response was YES.
[2023-08-30 02:50:30,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 68971 conditions, 12867 events. 7804/12867 cut-off events. For 68876/69206 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 90918 event pairs, 1621 based on Foata normal form. 205/12940 useless extension candidates. Maximal degree in co-relation 68945. Up to 5418 conditions per place. 
[2023-08-30 02:50:30,427 INFO  L137   encePairwiseOnDemand]: 265/269 looper letters, 113 selfloop transitions, 13 changer transitions 86/220 dead transitions.
[2023-08-30 02:50:30,427 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 220 transitions, 2440 flow
[2023-08-30 02:50:30,428 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-30 02:50:30,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-30 02:50:30,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions.
[2023-08-30 02:50:30,429 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.508364312267658
[2023-08-30 02:50:30,429 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 547 transitions.
[2023-08-30 02:50:30,429 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions.
[2023-08-30 02:50:30,430 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:30,430 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions.
[2023-08-30 02:50:30,431 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:30,432 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:30,433 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:30,433 INFO  L175             Difference]: Start difference. First operand has 83 places, 106 transitions, 937 flow. Second operand 4 states and 547 transitions.
[2023-08-30 02:50:30,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 220 transitions, 2440 flow
[2023-08-30 02:50:31,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 220 transitions, 2247 flow, removed 78 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:31,172 INFO  L231             Difference]: Finished difference. Result has 86 places, 98 transitions, 850 flow
[2023-08-30 02:50:31,172 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=850, PETRI_PLACES=86, PETRI_TRANSITIONS=98}
[2023-08-30 02:50:31,172 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 34 predicate places.
[2023-08-30 02:50:31,172 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 850 flow
[2023-08-30 02:50:31,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:31,173 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:31,173 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:31,173 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-08-30 02:50:31,173 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:31,174 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:31,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 544741165, now seen corresponding path program 1 times
[2023-08-30 02:50:31,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:31,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759557571]
[2023-08-30 02:50:31,174 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:31,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:31,210 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:31,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:31,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:31,385 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759557571]
[2023-08-30 02:50:31,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759557571] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:31,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:31,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 02:50:31,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961732584]
[2023-08-30 02:50:31,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:31,386 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 02:50:31,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:31,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 02:50:31,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 02:50:31,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 269
[2023-08-30 02:50:31,392 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 850 flow. Second operand  has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:31,392 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:31,392 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 269
[2023-08-30 02:50:31,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:32,926 INFO  L130       PetriNetUnfolder]: 6844/11496 cut-off events.
[2023-08-30 02:50:32,927 INFO  L131       PetriNetUnfolder]: For 57774/58289 co-relation queries the response was YES.
[2023-08-30 02:50:32,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57695 conditions, 11496 events. 6844/11496 cut-off events. For 57774/58289 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 83304 event pairs, 1270 based on Foata normal form. 255/11575 useless extension candidates. Maximal degree in co-relation 57666. Up to 6911 conditions per place. 
[2023-08-30 02:50:32,969 INFO  L137   encePairwiseOnDemand]: 266/269 looper letters, 116 selfloop transitions, 3 changer transitions 55/186 dead transitions.
[2023-08-30 02:50:32,969 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 186 transitions, 1948 flow
[2023-08-30 02:50:32,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-30 02:50:32,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-30 02:50:32,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions.
[2023-08-30 02:50:32,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5130111524163569
[2023-08-30 02:50:32,971 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 552 transitions.
[2023-08-30 02:50:32,971 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions.
[2023-08-30 02:50:32,971 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:32,972 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions.
[2023-08-30 02:50:32,973 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:32,974 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:32,974 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:32,975 INFO  L175             Difference]: Start difference. First operand has 86 places, 98 transitions, 850 flow. Second operand 4 states and 552 transitions.
[2023-08-30 02:50:32,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 186 transitions, 1948 flow
[2023-08-30 02:50:33,311 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 186 transitions, 1922 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:33,313 INFO  L231             Difference]: Finished difference. Result has 88 places, 91 transitions, 789 flow
[2023-08-30 02:50:33,313 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=789, PETRI_PLACES=88, PETRI_TRANSITIONS=91}
[2023-08-30 02:50:33,313 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places.
[2023-08-30 02:50:33,313 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 789 flow
[2023-08-30 02:50:33,314 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:33,314 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:33,314 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]
[2023-08-30 02:50:33,314 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-08-30 02:50:33,314 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:33,314 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:33,314 INFO  L85        PathProgramCache]: Analyzing trace with hash -340513625, now seen corresponding path program 2 times
[2023-08-30 02:50:33,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:33,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973936292]
[2023-08-30 02:50:33,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:33,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:33,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:33,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:33,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:33,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973936292]
[2023-08-30 02:50:33,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973936292] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:33,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:33,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 02:50:33,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307376033]
[2023-08-30 02:50:33,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:33,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 02:50:33,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:33,553 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 02:50:33,553 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 02:50:33,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 269
[2023-08-30 02:50:33,561 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 789 flow. Second operand  has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:33,561 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:33,561 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 269
[2023-08-30 02:50:33,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:35,011 INFO  L130       PetriNetUnfolder]: 9125/15314 cut-off events.
[2023-08-30 02:50:35,012 INFO  L131       PetriNetUnfolder]: For 79387/79637 co-relation queries the response was YES.
[2023-08-30 02:50:35,077 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 77554 conditions, 15314 events. 9125/15314 cut-off events. For 79387/79637 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 113835 event pairs, 1353 based on Foata normal form. 35/15216 useless extension candidates. Maximal degree in co-relation 77524. Up to 7378 conditions per place. 
[2023-08-30 02:50:35,106 INFO  L137   encePairwiseOnDemand]: 266/269 looper letters, 113 selfloop transitions, 2 changer transitions 69/194 dead transitions.
[2023-08-30 02:50:35,106 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 194 transitions, 2051 flow
[2023-08-30 02:50:35,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-30 02:50:35,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-30 02:50:35,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions.
[2023-08-30 02:50:35,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5111524163568774
[2023-08-30 02:50:35,109 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 550 transitions.
[2023-08-30 02:50:35,109 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions.
[2023-08-30 02:50:35,109 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:35,109 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions.
[2023-08-30 02:50:35,110 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:35,111 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:35,112 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:35,112 INFO  L175             Difference]: Start difference. First operand has 88 places, 91 transitions, 789 flow. Second operand 4 states and 550 transitions.
[2023-08-30 02:50:35,112 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 194 transitions, 2051 flow
[2023-08-30 02:50:36,099 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 194 transitions, 1946 flow, removed 50 selfloop flow, removed 4 redundant places.
[2023-08-30 02:50:36,100 INFO  L231             Difference]: Finished difference. Result has 85 places, 88 transitions, 729 flow
[2023-08-30 02:50:36,101 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=729, PETRI_PLACES=85, PETRI_TRANSITIONS=88}
[2023-08-30 02:50:36,101 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places.
[2023-08-30 02:50:36,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 729 flow
[2023-08-30 02:50:36,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:36,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:36,102 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:36,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-08-30 02:50:36,102 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:36,102 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:36,102 INFO  L85        PathProgramCache]: Analyzing trace with hash 135309613, now seen corresponding path program 2 times
[2023-08-30 02:50:36,102 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:36,102 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154345986]
[2023-08-30 02:50:36,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:36,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:36,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:36,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:36,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:36,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154345986]
[2023-08-30 02:50:36,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154345986] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:36,335 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:36,335 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-30 02:50:36,335 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194759689]
[2023-08-30 02:50:36,335 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:36,335 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-30 02:50:36,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:36,336 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-30 02:50:36,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2023-08-30 02:50:36,354 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 269
[2023-08-30 02:50:36,355 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 729 flow. Second operand  has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:36,355 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:36,355 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 269
[2023-08-30 02:50:36,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:37,604 INFO  L130       PetriNetUnfolder]: 6538/11103 cut-off events.
[2023-08-30 02:50:37,604 INFO  L131       PetriNetUnfolder]: For 53584/54210 co-relation queries the response was YES.
[2023-08-30 02:50:37,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53633 conditions, 11103 events. 6538/11103 cut-off events. For 53584/54210 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 83554 event pairs, 429 based on Foata normal form. 563/11397 useless extension candidates. Maximal degree in co-relation 53604. Up to 3221 conditions per place. 
[2023-08-30 02:50:37,652 INFO  L137   encePairwiseOnDemand]: 262/269 looper letters, 62 selfloop transitions, 18 changer transitions 155/240 dead transitions.
[2023-08-30 02:50:37,652 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 240 transitions, 2459 flow
[2023-08-30 02:50:37,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-08-30 02:50:37,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-30 02:50:37,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1169 transitions.
[2023-08-30 02:50:37,655 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4828583230070219
[2023-08-30 02:50:37,655 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1169 transitions.
[2023-08-30 02:50:37,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1169 transitions.
[2023-08-30 02:50:37,656 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:37,656 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1169 transitions.
[2023-08-30 02:50:37,658 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 129.88888888888889) internal successors, (1169), 9 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:37,661 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:37,661 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 269.0) internal successors, (2690), 10 states have internal predecessors, (2690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:37,661 INFO  L175             Difference]: Start difference. First operand has 85 places, 88 transitions, 729 flow. Second operand 9 states and 1169 transitions.
[2023-08-30 02:50:37,661 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 240 transitions, 2459 flow
[2023-08-30 02:50:38,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 240 transitions, 2427 flow, removed 11 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:38,259 INFO  L231             Difference]: Finished difference. Result has 94 places, 51 transitions, 434 flow
[2023-08-30 02:50:38,259 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=434, PETRI_PLACES=94, PETRI_TRANSITIONS=51}
[2023-08-30 02:50:38,260 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places.
[2023-08-30 02:50:38,260 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 51 transitions, 434 flow
[2023-08-30 02:50:38,260 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:38,261 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:38,261 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:38,261 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-08-30 02:50:38,261 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:38,261 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:38,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 344131377, now seen corresponding path program 1 times
[2023-08-30 02:50:38,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:38,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482781040]
[2023-08-30 02:50:38,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:38,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:38,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:38,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:38,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-30 02:50:38,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482781040]
[2023-08-30 02:50:38,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482781040] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:38,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:38,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 02:50:38,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435521654]
[2023-08-30 02:50:38,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:38,934 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-30 02:50:38,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-30 02:50:38,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-30 02:50:38,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-08-30 02:50:38,969 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 269
[2023-08-30 02:50:38,971 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 51 transitions, 434 flow. Second operand  has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:38,971 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:38,971 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 269
[2023-08-30 02:50:38,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:39,291 INFO  L130       PetriNetUnfolder]: 644/1095 cut-off events.
[2023-08-30 02:50:39,292 INFO  L131       PetriNetUnfolder]: For 4508/4550 co-relation queries the response was YES.
[2023-08-30 02:50:39,296 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 1095 events. 644/1095 cut-off events. For 4508/4550 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4843 event pairs, 100 based on Foata normal form. 23/1070 useless extension candidates. Maximal degree in co-relation 5418. Up to 615 conditions per place. 
[2023-08-30 02:50:39,298 INFO  L137   encePairwiseOnDemand]: 263/269 looper letters, 61 selfloop transitions, 11 changer transitions 35/112 dead transitions.
[2023-08-30 02:50:39,299 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 1128 flow
[2023-08-30 02:50:39,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-08-30 02:50:39,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 02:50:39,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 916 transitions.
[2023-08-30 02:50:39,301 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48645778013807756
[2023-08-30 02:50:39,302 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 916 transitions.
[2023-08-30 02:50:39,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 916 transitions.
[2023-08-30 02:50:39,302 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:39,302 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 916 transitions.
[2023-08-30 02:50:39,304 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 130.85714285714286) internal successors, (916), 7 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:39,307 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:39,307 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:39,307 INFO  L175             Difference]: Start difference. First operand has 94 places, 51 transitions, 434 flow. Second operand 7 states and 916 transitions.
[2023-08-30 02:50:39,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 1128 flow
[2023-08-30 02:50:39,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 879 flow, removed 57 selfloop flow, removed 19 redundant places.
[2023-08-30 02:50:39,321 INFO  L231             Difference]: Finished difference. Result has 76 places, 52 transitions, 355 flow
[2023-08-30 02:50:39,321 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=355, PETRI_PLACES=76, PETRI_TRANSITIONS=52}
[2023-08-30 02:50:39,322 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 24 predicate places.
[2023-08-30 02:50:39,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 355 flow
[2023-08-30 02:50:39,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:39,323 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:39,324 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:39,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-08-30 02:50:39,324 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:39,324 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:39,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -874092181, now seen corresponding path program 2 times
[2023-08-30 02:50:39,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-30 02:50:39,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607114062]
[2023-08-30 02:50:39,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:39,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-30 02:50:39,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 02:50:39,382 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-30 02:50:39,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 02:50:39,499 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-30 02:50:39,501 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-08-30 02:50:39,503 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining)
[2023-08-30 02:50:39,504 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining)
[2023-08-30 02:50:39,505 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining)
[2023-08-30 02:50:39,506 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining)
[2023-08-30 02:50:39,508 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining)
[2023-08-30 02:50:39,509 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining)
[2023-08-30 02:50:39,509 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining)
[2023-08-30 02:50:39,509 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining)
[2023-08-30 02:50:39,510 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining)
[2023-08-30 02:50:39,510 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining)
[2023-08-30 02:50:39,510 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining)
[2023-08-30 02:50:39,510 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining)
[2023-08-30 02:50:39,510 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining)
[2023-08-30 02:50:39,510 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining)
[2023-08-30 02:50:39,511 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining)
[2023-08-30 02:50:39,511 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining)
[2023-08-30 02:50:39,511 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-08-30 02:50:39,512 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:39,517 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-30 02:50:39,517 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-08-30 02:50:39,621 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:50:39 BasicIcfg
[2023-08-30 02:50:39,621 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-30 02:50:39,621 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-30 02:50:39,621 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-08-30 02:50:39,622 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-08-30 02:50:39,622 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:01" (3/4) ...
[2023-08-30 02:50:39,625 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-08-30 02:50:39,625 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-30 02:50:39,625 INFO  L158              Benchmark]: Toolchain (without parser) took 39411.59ms. Allocated memory was 90.2MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 67.6MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 689.8MB. Max. memory is 16.1GB.
[2023-08-30 02:50:39,625 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 02:50:39,626 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 493.42ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 67.8MB in the end (delta: -202.9kB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB.
[2023-08-30 02:50:39,626 INFO  L158              Benchmark]: Boogie Procedure Inliner took 61.93ms. Allocated memory is still 90.2MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 02:50:39,627 INFO  L158              Benchmark]: Boogie Preprocessor took 40.73ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 63.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 02:50:39,627 INFO  L158              Benchmark]: RCFGBuilder took 777.26ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 62.6MB in the end (delta: 541.4kB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB.
[2023-08-30 02:50:39,627 INFO  L158              Benchmark]: TraceAbstraction took 38028.71ms. Allocated memory was 90.2MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 61.6MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 683.0MB. Max. memory is 16.1GB.
[2023-08-30 02:50:39,627 INFO  L158              Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 5.4GB. Free memory is still 4.7GB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 02:50:39,629 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.18ms. Allocated memory is still 67.1MB. Free memory was 44.7MB in the beginning and 44.6MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 493.42ms. Allocated memory is still 90.2MB. Free memory was 67.6MB in the beginning and 67.8MB in the end (delta: -202.9kB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 61.93ms. Allocated memory is still 90.2MB. Free memory was 67.8MB in the beginning and 65.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 40.73ms. Allocated memory is still 90.2MB. Free memory was 65.2MB in the beginning and 63.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 777.26ms. Allocated memory is still 90.2MB. Free memory was 63.1MB in the beginning and 62.6MB in the end (delta: 541.4kB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 38028.71ms. Allocated memory was 90.2MB in the beginning and 5.4GB in the end (delta: 5.3GB). Free memory was 61.6MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 683.0MB. Max. memory is 16.1GB.
 * Witness Printer took 3.45ms. Allocated memory is still 5.4GB. Free memory is still 4.7GB. 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: 4.8s, 149 PlacesBefore, 52 PlacesAfterwards, 138 TransitionsBefore, 40 TransitionsAfterwards, 3338 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 127 TotalNumberOfCompositions, 10252 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4086, independent: 3817, independent conditional: 0, independent unconditional: 3817, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1757, independent: 1707, independent conditional: 0, independent unconditional: 1707, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4086, independent: 2110, independent conditional: 0, independent unconditional: 2110, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 1757, unknown conditional: 0, unknown unconditional: 1757] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 216, Positive conditional cache size: 0, Positive unconditional cache size: 216, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 19. 
Possible FailurePath: 
[L711]               0  int __unbuffered_cnt = 0;
[L713]               0  int __unbuffered_p0_EAX = 0;
[L715]               0  int __unbuffered_p1_EAX = 0;
[L717]               0  int __unbuffered_p3_EAX = 0;
[L719]               0  int __unbuffered_p3_EBX = 0;
[L721]               0  int a = 0;
[L722]               0  _Bool main$tmp_guard0;
[L723]               0  _Bool main$tmp_guard1;
[L725]               0  int x = 0;
[L726]               0  _Bool x$flush_delayed;
[L727]               0  int x$mem_tmp;
[L728]               0  _Bool x$r_buff0_thd0;
[L729]               0  _Bool x$r_buff0_thd1;
[L730]               0  _Bool x$r_buff0_thd2;
[L731]               0  _Bool x$r_buff0_thd3;
[L732]               0  _Bool x$r_buff0_thd4;
[L733]               0  _Bool x$r_buff1_thd0;
[L734]               0  _Bool x$r_buff1_thd1;
[L735]               0  _Bool x$r_buff1_thd2;
[L736]               0  _Bool x$r_buff1_thd3;
[L737]               0  _Bool x$r_buff1_thd4;
[L738]               0  _Bool x$read_delayed;
[L739]               0  int *x$read_delayed_var;
[L740]               0  int x$w_buff0;
[L741]               0  _Bool x$w_buff0_used;
[L742]               0  int x$w_buff1;
[L743]               0  _Bool x$w_buff1_used;
[L745]               0  int y = 0;
[L747]               0  int z = 0;
[L748]               0  _Bool weak$$choice0;
[L749]               0  _Bool weak$$choice2;
[L862]               0  pthread_t t685;
[L863]  FCALL, FORK  0  pthread_create(&t685, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-2, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L864]               0  pthread_t t686;
[L865]  FCALL, FORK  0  pthread_create(&t686, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-1, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L866]               0  pthread_t t687;
[L867]  FCALL, FORK  0  pthread_create(&t687, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L868]               0  pthread_t t688;
[L869]  FCALL, FORK  0  pthread_create(&t688, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=1, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L781]               2  x$w_buff1 = x$w_buff0
[L782]               2  x$w_buff0 = 1
[L783]               2  x$w_buff1_used = x$w_buff0_used
[L784]               2  x$w_buff0_used = (_Bool)1
[L785]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L785]  RET          2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L786]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L787]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L788]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L789]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L790]               2  x$r_buff1_thd4 = x$r_buff0_thd4
[L791]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L794]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L811]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L814]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L831]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L834]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L837]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L753]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L756]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L757]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L758]               1  x$flush_delayed = weak$$choice2
[L759]               1  x$mem_tmp = x
[L760]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L761]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L762]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L763]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L764]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L766]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L767]               1  __unbuffered_p0_EAX = x
[L768]               1  x = x$flush_delayed ? x$mem_tmp : x
[L769]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L797]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L799]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L800]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L801]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L804]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L806]               2  return 0;
[L774]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L776]               1  return 0;
[L817]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L818]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L819]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L820]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L821]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
        VAL             [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L824]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L826]               3  return 0;
[L840]               4  x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L841]               4  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L842]               4  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L843]               4  x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L844]               4  x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L847]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L849]               4  return 0;
[L871]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L873]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L873]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L875]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L876]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L877]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L878]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L879]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L882]               0  main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L884]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]

  - UnprovableResult [Line: 19]: 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: 860]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 865]: 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: 869]: 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: 863]: 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: 867]: 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, 178 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: 37.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 983 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 794 mSDsluCounter, 398 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 321 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2691 IncrementalHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 77 mSDtfsCounter, 2691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=10, InterpolantAutomatonStates: 83, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 276 NumberOfCodeBlocks, 276 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 1943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-08-30 02:50:39,662 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/mix026_power.opt_tso.opt.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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-08-30 02:50:41,853 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-08-30 02:50:41,855 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-30 02:50:41,898 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-30 02:50:41,899 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-30 02:50:41,902 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-30 02:50:41,903 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-30 02:50:41,906 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-30 02:50:41,909 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-30 02:50:41,913 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-30 02:50:41,914 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-08-30 02:50:41,916 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-30 02:50:41,917 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-30 02:50:41,918 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-30 02:50:41,919 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-30 02:50:41,923 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-30 02:50:41,923 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-30 02:50:41,925 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-30 02:50:41,926 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-30 02:50:41,927 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-30 02:50:41,933 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-30 02:50:41,934 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-30 02:50:41,935 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-08-30 02:50:41,936 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-30 02:50:41,944 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-30 02:50:41,944 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-30 02:50:41,945 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-30 02:50:41,947 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-30 02:50:41,947 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-30 02:50:41,948 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-30 02:50:41,948 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-30 02:50:41,950 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-30 02:50:41,952 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-30 02:50:41,953 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-30 02:50:41,954 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-30 02:50:41,954 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-30 02:50:41,955 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-30 02:50:41,955 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-30 02:50:41,955 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-30 02:50:41,956 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-30 02:50:41,957 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-08-30 02:50:41,959 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2023-08-30 02:50:41,992 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-08-30 02:50:41,993 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-30 02:50:41,994 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-30 02:50:41,994 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-30 02:50:41,995 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-30 02:50:41,995 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-30 02:50:41,995 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-30 02:50:41,996 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-08-30 02:50:41,996 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-08-30 02:50:41,996 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-30 02:50:41,997 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-08-30 02:50:41,997 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-08-30 02:50:41,997 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-08-30 02:50:41,998 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-08-30 02:50:41,998 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-08-30 02:50:41,998 INFO  L138        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2023-08-30 02:50:41,998 INFO  L138        SettingsManager]:  * Bitprecise bitfields=true
[2023-08-30 02:50:41,998 INFO  L138        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2023-08-30 02:50:41,999 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-30 02:50:41,999 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-08-30 02:50:41,999 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-08-30 02:50:41,999 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-08-30 02:50:41,999 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-08-30 02:50:41,999 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-08-30 02:50:42,000 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-30 02:50:42,000 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-08-30 02:50:42,000 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-08-30 02:50:42,000 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 02:50:42,001 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-30 02:50:42,001 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-08-30 02:50:42,001 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-08-30 02:50:42,001 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-08-30 02:50:42,002 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-30 02:50:42,002 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-08-30 02:50:42,002 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-30 02:50:42,002 INFO  L138        SettingsManager]:  * Logic for external solver=AUFBV
[2023-08-30 02:50:42,002 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-30 02:50:42,003 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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER
[2023-08-30 02:50:42,315 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-30 02:50:42,335 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-30 02:50:42,338 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-30 02:50:42,339 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-08-30 02:50:42,339 INFO  L275        PluginConnector]: CDTParser initialized
[2023-08-30 02:50:42,340 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i
[2023-08-30 02:50:43,474 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-08-30 02:50:43,771 INFO  L351              CDTParser]: Found 1 translation units.
[2023-08-30 02:50:43,772 INFO  L172              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i
[2023-08-30 02:50:43,789 INFO  L394              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b27f510/dc6f25ecb3484f43a7c9886a6c1362b4/FLAG8df79e632
[2023-08-30 02:50:43,810 INFO  L402              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2b27f510/dc6f25ecb3484f43a7c9886a6c1362b4
[2023-08-30 02:50:43,812 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-30 02:50:43,813 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-30 02:50:43,816 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-30 02:50:43,816 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-30 02:50:43,819 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-30 02:50:43,820 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:43" (1/1) ...
[2023-08-30 02:50:43,822 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bbacd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:43, skipping insertion in model container
[2023-08-30 02:50:43,822 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 02:50:43" (1/1) ...
[2023-08-30 02:50:43,827 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-08-30 02:50:43,862 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-08-30 02:50:44,043 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/mix026_power.opt_tso.opt.i[1001,1014]
[2023-08-30 02:50:44,278 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-30 02:50:44,296 INFO  L203         MainTranslator]: Completed pre-run
[2023-08-30 02:50:44,309 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/mix026_power.opt_tso.opt.i[1001,1014]
[2023-08-30 02:50:44,352 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-30 02:50:44,391 WARN  L667               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 02:50:44,392 WARN  L667               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-30 02:50:44,398 INFO  L208         MainTranslator]: Completed translation
[2023-08-30 02:50:44,398 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44 WrapperNode
[2023-08-30 02:50:44,398 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-30 02:50:44,399 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-30 02:50:44,400 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-30 02:50:44,400 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-30 02:50:44,405 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,434 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,454 INFO  L138                Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146
[2023-08-30 02:50:44,454 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-30 02:50:44,455 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-30 02:50:44,455 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-30 02:50:44,455 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-08-30 02:50:44,463 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,463 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,466 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,467 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,476 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,478 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,480 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,481 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,485 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-30 02:50:44,485 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-30 02:50:44,486 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-08-30 02:50:44,486 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-08-30 02:50:44,486 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (1/1) ...
[2023-08-30 02:50:44,491 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-30 02:50:44,501 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-30 02:50:44,521 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:44,538 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-08-30 02:50:44,566 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-30 02:50:44,567 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-30 02:50:44,567 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-30 02:50:44,567 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-30 02:50:44,567 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-08-30 02:50:44,567 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-08-30 02:50:44,567 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-08-30 02:50:44,567 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-08-30 02:50:44,567 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-08-30 02:50:44,567 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-08-30 02:50:44,568 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-08-30 02:50:44,568 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-08-30 02:50:44,568 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2023-08-30 02:50:44,568 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2023-08-30 02:50:44,568 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-30 02:50:44,568 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-30 02:50:44,568 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-30 02:50:44,570 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-30 02:50:44,782 INFO  L236             CfgBuilder]: Building ICFG
[2023-08-30 02:50:44,784 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-30 02:50:45,122 INFO  L277             CfgBuilder]: Performing block encoding
[2023-08-30 02:50:45,278 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-30 02:50:45,278 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-30 02:50:45,281 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:45 BoogieIcfgContainer
[2023-08-30 02:50:45,281 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-30 02:50:45,283 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-30 02:50:45,283 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-08-30 02:50:45,285 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-08-30 02:50:45,286 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 02:50:43" (1/3) ...
[2023-08-30 02:50:45,286 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ce692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:45, skipping insertion in model container
[2023-08-30 02:50:45,286 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 02:50:44" (2/3) ...
[2023-08-30 02:50:45,287 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ce692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 02:50:45, skipping insertion in model container
[2023-08-30 02:50:45,287 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:45" (3/3) ...
[2023-08-30 02:50:45,288 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i
[2023-08-30 02:50:45,302 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-30 02:50:45,302 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations.
[2023-08-30 02:50:45,302 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-30 02:50:45,376 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-30 02:50:45,419 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow
[2023-08-30 02:50:45,499 INFO  L130       PetriNetUnfolder]: 2/139 cut-off events.
[2023-08-30 02:50:45,499 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:45,505 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. 
[2023-08-30 02:50:45,505 INFO  L82        GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow
[2023-08-30 02:50:45,513 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow
[2023-08-30 02:50:45,516 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-30 02:50:45,523 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow
[2023-08-30 02:50:45,525 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow
[2023-08-30 02:50:45,526 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow
[2023-08-30 02:50:45,548 INFO  L130       PetriNetUnfolder]: 2/139 cut-off events.
[2023-08-30 02:50:45,549 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:45,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. 
[2023-08-30 02:50:45,552 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3338
[2023-08-30 02:50:52,610 INFO  L134        LiptonReduction]: Checked pairs total: 9453
[2023-08-30 02:50:52,610 INFO  L136        LiptonReduction]: Total number of compositions: 132
[2023-08-30 02:50:52,622 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-30 02:50:52,629 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;@73dab551, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-30 02:50:52,629 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 16 error locations.
[2023-08-30 02:50:52,630 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-08-30 02:50:52,631 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:52,631 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:52,631 INFO  L208   CegarLoopForPetriNet]: trace histogram [1]
[2023-08-30 02:50:52,632 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:52,635 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:52,636 INFO  L85        PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times
[2023-08-30 02:50:52,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:50:52,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434128363]
[2023-08-30 02:50:52,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:52,646 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:52,646 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:50:52,649 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:52,650 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-08-30 02:50:52,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:52,718 INFO  L263         TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-08-30 02:50:52,721 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:50:52,724 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:52,725 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:50:52,725 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:50:52,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434128363]
[2023-08-30 02:50:52,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [434128363] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:52,726 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:52,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-30 02:50:52,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259855917]
[2023-08-30 02:50:52,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:52,734 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-30 02:50:52,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:50:52,760 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-30 02:50:52,760 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-30 02:50:52,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 275
[2023-08-30 02:50:52,770 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand  has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:52,770 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:52,770 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 275
[2023-08-30 02:50:52,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:54,011 INFO  L130       PetriNetUnfolder]: 6949/9657 cut-off events.
[2023-08-30 02:50:54,011 INFO  L131       PetriNetUnfolder]: For 43/43 co-relation queries the response was YES.
[2023-08-30 02:50:54,031 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19271 conditions, 9657 events. 6949/9657 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 51267 event pairs, 6949 based on Foata normal form. 0/8325 useless extension candidates. Maximal degree in co-relation 19259. Up to 9399 conditions per place. 
[2023-08-30 02:50:54,081 INFO  L137   encePairwiseOnDemand]: 266/275 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions.
[2023-08-30 02:50:54,081 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow
[2023-08-30 02:50:54,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-08-30 02:50:54,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-30 02:50:54,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions.
[2023-08-30 02:50:54,099 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5345454545454545
[2023-08-30 02:50:54,100 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 294 transitions.
[2023-08-30 02:50:54,100 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 294 transitions.
[2023-08-30 02:50:54,103 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:54,105 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 294 transitions.
[2023-08-30 02:50:54,112 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 147.0) internal successors, (294), 2 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:54,117 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:54,118 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:54,120 INFO  L175             Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 294 transitions.
[2023-08-30 02:50:54,123 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow
[2023-08-30 02:50:54,129 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-08-30 02:50:54,131 INFO  L231             Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow
[2023-08-30 02:50:54,133 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31}
[2023-08-30 02:50:54,136 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places.
[2023-08-30 02:50:54,137 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow
[2023-08-30 02:50:54,137 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 129.5) internal successors, (259), 2 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:54,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:54,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-08-30 02:50:54,156 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-30 02:50:54,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:54,357 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:54,357 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:54,357 INFO  L85        PathProgramCache]: Analyzing trace with hash 561804810, now seen corresponding path program 1 times
[2023-08-30 02:50:54,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:50:54,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025044467]
[2023-08-30 02:50:54,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:54,359 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:54,359 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:50:54,364 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:54,365 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-08-30 02:50:54,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:54,443 INFO  L263         TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-30 02:50:54,444 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:50:54,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:54,467 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:50:54,467 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:50:54,467 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025044467]
[2023-08-30 02:50:54,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025044467] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:54,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:54,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-30 02:50:54,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059757121]
[2023-08-30 02:50:54,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:54,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-30 02:50:54,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:50:54,470 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-30 02:50:54,470 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-30 02:50:54,473 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 275
[2023-08-30 02:50:54,474 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand  has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:54,474 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:54,474 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 275
[2023-08-30 02:50:54,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:55,327 INFO  L130       PetriNetUnfolder]: 5463/7964 cut-off events.
[2023-08-30 02:50:55,327 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-30 02:50:55,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15561 conditions, 7964 events. 5463/7964 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 46971 event pairs, 1005 based on Foata normal form. 0/7392 useless extension candidates. Maximal degree in co-relation 15558. Up to 5923 conditions per place. 
[2023-08-30 02:50:55,373 INFO  L137   encePairwiseOnDemand]: 272/275 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions.
[2023-08-30 02:50:55,374 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow
[2023-08-30 02:50:55,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-30 02:50:55,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-30 02:50:55,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions.
[2023-08-30 02:50:55,376 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5212121212121212
[2023-08-30 02:50:55,376 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 430 transitions.
[2023-08-30 02:50:55,377 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions.
[2023-08-30 02:50:55,377 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:55,377 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions.
[2023-08-30 02:50:55,378 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:55,381 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:55,381 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:55,381 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 430 transitions.
[2023-08-30 02:50:55,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow
[2023-08-30 02:50:55,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-30 02:50:55,383 INFO  L231             Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow
[2023-08-30 02:50:55,383 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, 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=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29}
[2023-08-30 02:50:55,384 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places.
[2023-08-30 02:50:55,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow
[2023-08-30 02:50:55,385 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:55,385 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:55,385 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:55,399 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2023-08-30 02:50:55,594 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:55,595 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:55,595 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:55,596 INFO  L85        PathProgramCache]: Analyzing trace with hash 1256774155, now seen corresponding path program 1 times
[2023-08-30 02:50:55,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:50:55,602 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729622459]
[2023-08-30 02:50:55,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:55,602 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:55,602 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:50:55,604 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:55,607 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2023-08-30 02:50:55,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:55,701 INFO  L263         TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-30 02:50:55,702 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:50:55,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:55,744 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:50:55,744 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:50:55,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729622459]
[2023-08-30 02:50:55,745 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729622459] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:55,745 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:55,745 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 02:50:55,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528221945]
[2023-08-30 02:50:55,746 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:55,746 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 02:50:55,746 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:50:55,747 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 02:50:55,747 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 02:50:55,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275
[2023-08-30 02:50:55,763 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:55,763 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:55,763 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275
[2023-08-30 02:50:55,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:56,451 INFO  L130       PetriNetUnfolder]: 3668/5290 cut-off events.
[2023-08-30 02:50:56,451 INFO  L131       PetriNetUnfolder]: For 351/351 co-relation queries the response was YES.
[2023-08-30 02:50:56,460 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11042 conditions, 5290 events. 3668/5290 cut-off events. For 351/351 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 27962 event pairs, 707 based on Foata normal form. 256/5306 useless extension candidates. Maximal degree in co-relation 11038. Up to 3944 conditions per place. 
[2023-08-30 02:50:56,481 INFO  L137   encePairwiseOnDemand]: 268/275 looper letters, 38 selfloop transitions, 5 changer transitions 25/72 dead transitions.
[2023-08-30 02:50:56,481 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 304 flow
[2023-08-30 02:50:56,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-30 02:50:56,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 02:50:56,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions.
[2023-08-30 02:50:56,484 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49818181818181817
[2023-08-30 02:50:56,484 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 685 transitions.
[2023-08-30 02:50:56,484 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions.
[2023-08-30 02:50:56,485 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:56,485 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions.
[2023-08-30 02:50:56,486 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:56,489 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:56,490 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:56,490 INFO  L175             Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 685 transitions.
[2023-08-30 02:50:56,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 304 flow
[2023-08-30 02:50:56,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:56,492 INFO  L231             Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow
[2023-08-30 02:50:56,493 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33}
[2023-08-30 02:50:56,493 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places.
[2023-08-30 02:50:56,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow
[2023-08-30 02:50:56,494 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:56,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:56,494 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:56,507 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2023-08-30 02:50:56,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:56,705 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:56,705 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:56,705 INFO  L85        PathProgramCache]: Analyzing trace with hash -429277655, now seen corresponding path program 1 times
[2023-08-30 02:50:56,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:50:56,706 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043941901]
[2023-08-30 02:50:56,706 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:56,706 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:56,706 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:50:56,707 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:56,724 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2023-08-30 02:50:56,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:56,810 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-30 02:50:56,811 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:50:56,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:56,863 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:50:56,863 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:50:56,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043941901]
[2023-08-30 02:50:56,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043941901] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:56,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:56,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 02:50:56,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138433063]
[2023-08-30 02:50:56,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:56,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 02:50:56,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:50:56,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 02:50:56,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-30 02:50:56,891 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275
[2023-08-30 02:50:56,892 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand  has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:56,892 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:56,892 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275
[2023-08-30 02:50:56,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:57,405 INFO  L130       PetriNetUnfolder]: 1832/2833 cut-off events.
[2023-08-30 02:50:57,405 INFO  L131       PetriNetUnfolder]: For 1038/1038 co-relation queries the response was YES.
[2023-08-30 02:50:57,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7523 conditions, 2833 events. 1832/2833 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14635 event pairs, 344 based on Foata normal form. 175/2910 useless extension candidates. Maximal degree in co-relation 7516. Up to 1244 conditions per place. 
[2023-08-30 02:50:57,419 INFO  L137   encePairwiseOnDemand]: 268/275 looper letters, 50 selfloop transitions, 9 changer transitions 25/88 dead transitions.
[2023-08-30 02:50:57,419 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 449 flow
[2023-08-30 02:50:57,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-08-30 02:50:57,420 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 02:50:57,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions.
[2023-08-30 02:50:57,422 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4993939393939394
[2023-08-30 02:50:57,422 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 824 transitions.
[2023-08-30 02:50:57,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions.
[2023-08-30 02:50:57,423 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:57,423 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions.
[2023-08-30 02:50:57,425 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:57,427 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:57,428 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:57,428 INFO  L175             Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 824 transitions.
[2023-08-30 02:50:57,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 449 flow
[2023-08-30 02:50:57,442 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 442 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-08-30 02:50:57,443 INFO  L231             Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow
[2023-08-30 02:50:57,443 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37}
[2023-08-30 02:50:57,445 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places.
[2023-08-30 02:50:57,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow
[2023-08-30 02:50:57,446 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:57,446 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:57,446 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:57,458 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-30 02:50:57,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:57,656 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:57,656 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:57,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 882598873, now seen corresponding path program 1 times
[2023-08-30 02:50:57,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:50:57,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341420825]
[2023-08-30 02:50:57,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:57,657 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:57,657 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:50:57,658 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:57,659 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2023-08-30 02:50:57,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:57,771 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-08-30 02:50:57,772 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:50:57,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:57,837 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:50:57,837 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:50:57,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341420825]
[2023-08-30 02:50:57,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [341420825] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:57,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:57,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-30 02:50:57,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653358663]
[2023-08-30 02:50:57,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:57,839 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 02:50:57,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:50:57,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 02:50:57,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-30 02:50:57,861 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275
[2023-08-30 02:50:57,862 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand  has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:57,862 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:57,862 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275
[2023-08-30 02:50:57,862 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:58,273 INFO  L130       PetriNetUnfolder]: 1022/1645 cut-off events.
[2023-08-30 02:50:58,273 INFO  L131       PetriNetUnfolder]: For 1584/1584 co-relation queries the response was YES.
[2023-08-30 02:50:58,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4946 conditions, 1645 events. 1022/1645 cut-off events. For 1584/1584 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7921 event pairs, 277 based on Foata normal form. 67/1676 useless extension candidates. Maximal degree in co-relation 4937. Up to 540 conditions per place. 
[2023-08-30 02:50:58,281 INFO  L137   encePairwiseOnDemand]: 268/275 looper letters, 60 selfloop transitions, 13 changer transitions 25/102 dead transitions.
[2023-08-30 02:50:58,281 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 614 flow
[2023-08-30 02:50:58,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-08-30 02:50:58,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-30 02:50:58,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 961 transitions.
[2023-08-30 02:50:58,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49922077922077923
[2023-08-30 02:50:58,285 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 961 transitions.
[2023-08-30 02:50:58,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 961 transitions.
[2023-08-30 02:50:58,286 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:58,286 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 961 transitions.
[2023-08-30 02:50:58,288 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 137.28571428571428) internal successors, (961), 7 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:58,291 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:58,291 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:58,292 INFO  L175             Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 961 transitions.
[2023-08-30 02:50:58,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 614 flow
[2023-08-30 02:50:58,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 102 transitions, 552 flow, removed 26 selfloop flow, removed 4 redundant places.
[2023-08-30 02:50:58,307 INFO  L231             Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow
[2023-08-30 02:50:58,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41}
[2023-08-30 02:50:58,309 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places.
[2023-08-30 02:50:58,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow
[2023-08-30 02:50:58,313 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:58,313 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:58,313 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:50:58,323 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2023-08-30 02:50:58,523 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:58,524 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:58,525 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:58,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 528947802, now seen corresponding path program 1 times
[2023-08-30 02:50:58,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:50:58,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610649786]
[2023-08-30 02:50:58,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:58,526 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:58,526 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:50:58,527 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:58,530 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2023-08-30 02:50:58,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:58,635 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-08-30 02:50:58,637 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:50:58,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:58,710 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:50:58,711 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:50:58,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610649786]
[2023-08-30 02:50:58,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [610649786] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:58,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:58,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-30 02:50:58,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421547097]
[2023-08-30 02:50:58,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:58,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-30 02:50:58,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:50:58,715 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-30 02:50:58,715 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2023-08-30 02:50:58,749 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275
[2023-08-30 02:50:58,750 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:58,750 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:58,750 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275
[2023-08-30 02:50:58,750 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:59,201 INFO  L130       PetriNetUnfolder]: 866/1375 cut-off events.
[2023-08-30 02:50:59,201 INFO  L131       PetriNetUnfolder]: For 1260/1260 co-relation queries the response was YES.
[2023-08-30 02:50:59,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3982 conditions, 1375 events. 866/1375 cut-off events. For 1260/1260 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6424 event pairs, 272 based on Foata normal form. 13/1364 useless extension candidates. Maximal degree in co-relation 3972. Up to 540 conditions per place. 
[2023-08-30 02:50:59,208 INFO  L137   encePairwiseOnDemand]: 268/275 looper letters, 56 selfloop transitions, 17 changer transitions 13/90 dead transitions.
[2023-08-30 02:50:59,208 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 554 flow
[2023-08-30 02:50:59,209 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-08-30 02:50:59,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-30 02:50:59,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions.
[2023-08-30 02:50:59,212 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48727272727272725
[2023-08-30 02:50:59,212 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions.
[2023-08-30 02:50:59,212 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions.
[2023-08-30 02:50:59,212 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:50:59,213 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions.
[2023-08-30 02:50:59,215 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:59,217 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:59,218 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:59,218 INFO  L175             Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1072 transitions.
[2023-08-30 02:50:59,218 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 554 flow
[2023-08-30 02:50:59,231 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 492 flow, removed 22 selfloop flow, removed 5 redundant places.
[2023-08-30 02:50:59,233 INFO  L231             Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow
[2023-08-30 02:50:59,233 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41}
[2023-08-30 02:50:59,236 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places.
[2023-08-30 02:50:59,236 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow
[2023-08-30 02:50:59,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:59,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:50:59,237 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, 1]
[2023-08-30 02:50:59,247 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2023-08-30 02:50:59,446 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:59,447 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:50:59,447 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:50:59,447 INFO  L85        PathProgramCache]: Analyzing trace with hash 1015368267, now seen corresponding path program 1 times
[2023-08-30 02:50:59,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:50:59,448 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404791004]
[2023-08-30 02:50:59,448 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:50:59,448 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:50:59,448 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:50:59,449 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:50:59,450 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2023-08-30 02:50:59,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:50:59,574 INFO  L263         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-30 02:50:59,575 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:50:59,638 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:50:59,638 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:50:59,638 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:50:59,638 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404791004]
[2023-08-30 02:50:59,638 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [404791004] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:50:59,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:50:59,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 02:50:59,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172513269]
[2023-08-30 02:50:59,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:50:59,639 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 02:50:59,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:50:59,640 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 02:50:59,640 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-30 02:50:59,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 275
[2023-08-30 02:50:59,658 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand  has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:50:59,658 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:50:59,658 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 275
[2023-08-30 02:50:59,658 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:50:59,985 INFO  L130       PetriNetUnfolder]: 1263/1921 cut-off events.
[2023-08-30 02:50:59,986 INFO  L131       PetriNetUnfolder]: For 2291/2291 co-relation queries the response was YES.
[2023-08-30 02:50:59,990 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5730 conditions, 1921 events. 1263/1921 cut-off events. For 2291/2291 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9635 event pairs, 158 based on Foata normal form. 0/1912 useless extension candidates. Maximal degree in co-relation 5719. Up to 1163 conditions per place. 
[2023-08-30 02:50:59,998 INFO  L137   encePairwiseOnDemand]: 271/275 looper letters, 83 selfloop transitions, 3 changer transitions 0/89 dead transitions.
[2023-08-30 02:50:59,998 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 671 flow
[2023-08-30 02:50:59,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-30 02:50:59,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 02:51:00,000 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions.
[2023-08-30 02:51:00,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49236363636363634
[2023-08-30 02:51:00,001 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 677 transitions.
[2023-08-30 02:51:00,001 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions.
[2023-08-30 02:51:00,001 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:51:00,002 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions.
[2023-08-30 02:51:00,003 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:00,005 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:00,005 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:00,005 INFO  L175             Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 5 states and 677 transitions.
[2023-08-30 02:51:00,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 671 flow
[2023-08-30 02:51:00,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 89 transitions, 530 flow, removed 38 selfloop flow, removed 7 redundant places.
[2023-08-30 02:51:00,020 INFO  L231             Difference]: Finished difference. Result has 54 places, 43 transitions, 177 flow
[2023-08-30 02:51:00,020 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=54, PETRI_TRANSITIONS=43}
[2023-08-30 02:51:00,021 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places.
[2023-08-30 02:51:00,021 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 177 flow
[2023-08-30 02:51:00,022 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:00,022 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:51:00,022 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, 1]
[2023-08-30 02:51:00,033 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2023-08-30 02:51:00,232 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:00,233 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:51:00,234 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:51:00,234 INFO  L85        PathProgramCache]: Analyzing trace with hash -755454821, now seen corresponding path program 2 times
[2023-08-30 02:51:00,235 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:51:00,235 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007644021]
[2023-08-30 02:51:00,235 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-08-30 02:51:00,235 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:00,235 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:51:00,236 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:51:00,239 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2023-08-30 02:51:00,345 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-08-30 02:51:00,346 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-30 02:51:00,349 INFO  L263         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 17 conjunts are in the unsatisfiable core
[2023-08-30 02:51:00,352 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:51:00,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:51:00,794 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:51:00,797 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:51:00,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007644021]
[2023-08-30 02:51:00,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007644021] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:51:00,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:51:00,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-08-30 02:51:00,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436229599]
[2023-08-30 02:51:00,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:51:00,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-08-30 02:51:00,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:51:00,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-08-30 02:51:00,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2023-08-30 02:51:00,885 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275
[2023-08-30 02:51:00,886 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 177 flow. Second operand  has 9 states, 9 states have (on average 124.66666666666667) internal successors, (1122), 9 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:00,887 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:51:00,887 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275
[2023-08-30 02:51:00,887 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:51:01,417 INFO  L130       PetriNetUnfolder]: 1363/2269 cut-off events.
[2023-08-30 02:51:01,417 INFO  L131       PetriNetUnfolder]: For 1763/1763 co-relation queries the response was YES.
[2023-08-30 02:51:01,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6258 conditions, 2269 events. 1363/2269 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12738 event pairs, 162 based on Foata normal form. 1/2248 useless extension candidates. Maximal degree in co-relation 6247. Up to 840 conditions per place. 
[2023-08-30 02:51:01,431 INFO  L137   encePairwiseOnDemand]: 268/275 looper letters, 97 selfloop transitions, 8 changer transitions 0/110 dead transitions.
[2023-08-30 02:51:01,432 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 110 transitions, 681 flow
[2023-08-30 02:51:01,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-08-30 02:51:01,433 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-30 02:51:01,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1044 transitions.
[2023-08-30 02:51:01,435 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47454545454545455
[2023-08-30 02:51:01,435 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 1044 transitions.
[2023-08-30 02:51:01,436 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 1044 transitions.
[2023-08-30 02:51:01,436 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:51:01,436 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1044 transitions.
[2023-08-30 02:51:01,439 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 130.5) internal successors, (1044), 8 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:01,442 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:01,442 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:01,443 INFO  L175             Difference]: Start difference. First operand has 54 places, 43 transitions, 177 flow. Second operand 8 states and 1044 transitions.
[2023-08-30 02:51:01,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 110 transitions, 681 flow
[2023-08-30 02:51:01,461 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 110 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-30 02:51:01,462 INFO  L231             Difference]: Finished difference. Result has 63 places, 47 transitions, 222 flow
[2023-08-30 02:51:01,463 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=47}
[2023-08-30 02:51:01,463 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places.
[2023-08-30 02:51:01,463 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 222 flow
[2023-08-30 02:51:01,464 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 124.66666666666667) internal successors, (1122), 9 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:01,464 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:51:01,464 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, 1]
[2023-08-30 02:51:01,478 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2023-08-30 02:51:01,674 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:01,675 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:51:01,675 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:51:01,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 314363979, now seen corresponding path program 3 times
[2023-08-30 02:51:01,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:51:01,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817298692]
[2023-08-30 02:51:01,676 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-08-30 02:51:01,676 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:01,676 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:51:01,678 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:51:01,681 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2023-08-30 02:51:01,798 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2023-08-30 02:51:01,798 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-30 02:51:01,803 INFO  L263         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-30 02:51:01,805 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:51:01,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:51:01,854 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:51:01,855 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:51:01,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817298692]
[2023-08-30 02:51:01,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [817298692] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:51:01,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:51:01,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 02:51:01,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860021584]
[2023-08-30 02:51:01,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:51:01,856 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-30 02:51:01,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:51:01,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-30 02:51:01,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-30 02:51:01,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 275
[2023-08-30 02:51:01,873 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 222 flow. Second operand  has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:01,873 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:51:01,873 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 275
[2023-08-30 02:51:01,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:51:02,316 INFO  L130       PetriNetUnfolder]: 2394/3852 cut-off events.
[2023-08-30 02:51:02,316 INFO  L131       PetriNetUnfolder]: For 3565/3565 co-relation queries the response was YES.
[2023-08-30 02:51:02,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11715 conditions, 3852 events. 2394/3852 cut-off events. For 3565/3565 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22154 event pairs, 440 based on Foata normal form. 1/3831 useless extension candidates. Maximal degree in co-relation 11701. Up to 1874 conditions per place. 
[2023-08-30 02:51:02,340 INFO  L137   encePairwiseOnDemand]: 271/275 looper letters, 89 selfloop transitions, 6 changer transitions 0/99 dead transitions.
[2023-08-30 02:51:02,340 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 672 flow
[2023-08-30 02:51:02,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-30 02:51:02,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-30 02:51:02,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions.
[2023-08-30 02:51:02,343 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4909090909090909
[2023-08-30 02:51:02,343 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 675 transitions.
[2023-08-30 02:51:02,344 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions.
[2023-08-30 02:51:02,344 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:51:02,344 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions.
[2023-08-30 02:51:02,346 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:02,348 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:02,348 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:02,348 INFO  L175             Difference]: Start difference. First operand has 63 places, 47 transitions, 222 flow. Second operand 5 states and 675 transitions.
[2023-08-30 02:51:02,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 672 flow
[2023-08-30 02:51:02,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 661 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-30 02:51:02,406 INFO  L231             Difference]: Finished difference. Result has 67 places, 52 transitions, 285 flow
[2023-08-30 02:51:02,406 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=67, PETRI_TRANSITIONS=52}
[2023-08-30 02:51:02,407 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places.
[2023-08-30 02:51:02,407 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 285 flow
[2023-08-30 02:51:02,408 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:02,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:51:02,408 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, 1]
[2023-08-30 02:51:02,425 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2023-08-30 02:51:02,623 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:02,623 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:51:02,624 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:51:02,624 INFO  L85        PathProgramCache]: Analyzing trace with hash -1100662319, now seen corresponding path program 4 times
[2023-08-30 02:51:02,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:51:02,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169192810]
[2023-08-30 02:51:02,625 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-08-30 02:51:02,625 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:02,625 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:51:02,626 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:51:02,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 (11)] Waiting until timeout for monitored process
[2023-08-30 02:51:02,742 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-08-30 02:51:02,742 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-30 02:51:02,747 INFO  L263         TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-30 02:51:02,749 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:51:02,769 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:51:02,769 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:51:02,770 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:51:02,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169192810]
[2023-08-30 02:51:02,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [169192810] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:51:02,770 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:51:02,770 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-30 02:51:02,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449418483]
[2023-08-30 02:51:02,770 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:51:02,772 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-30 02:51:02,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:51:02,773 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-30 02:51:02,773 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-30 02:51:02,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275
[2023-08-30 02:51:02,785 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 285 flow. Second operand  has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:02,785 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:51:02,785 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275
[2023-08-30 02:51:02,785 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:51:03,483 INFO  L130       PetriNetUnfolder]: 3750/6108 cut-off events.
[2023-08-30 02:51:03,483 INFO  L131       PetriNetUnfolder]: For 6307/6307 co-relation queries the response was YES.
[2023-08-30 02:51:03,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18931 conditions, 6108 events. 3750/6108 cut-off events. For 6307/6307 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 38797 event pairs, 1179 based on Foata normal form. 1/5992 useless extension candidates. Maximal degree in co-relation 18914. Up to 3047 conditions per place. 
[2023-08-30 02:51:03,523 INFO  L137   encePairwiseOnDemand]: 271/275 looper letters, 75 selfloop transitions, 10 changer transitions 0/90 dead transitions.
[2023-08-30 02:51:03,523 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 90 transitions, 683 flow
[2023-08-30 02:51:03,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-30 02:51:03,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-30 02:51:03,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions.
[2023-08-30 02:51:03,525 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49454545454545457
[2023-08-30 02:51:03,526 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 544 transitions.
[2023-08-30 02:51:03,526 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions.
[2023-08-30 02:51:03,526 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:51:03,526 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions.
[2023-08-30 02:51:03,528 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:03,529 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:03,530 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:03,530 INFO  L175             Difference]: Start difference. First operand has 67 places, 52 transitions, 285 flow. Second operand 4 states and 544 transitions.
[2023-08-30 02:51:03,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 90 transitions, 683 flow
[2023-08-30 02:51:03,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 90 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-30 02:51:03,651 INFO  L231             Difference]: Finished difference. Result has 71 places, 61 transitions, 432 flow
[2023-08-30 02:51:03,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=71, PETRI_TRANSITIONS=61}
[2023-08-30 02:51:03,651 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places.
[2023-08-30 02:51:03,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 432 flow
[2023-08-30 02:51:03,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:03,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:51:03,652 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, 1]
[2023-08-30 02:51:03,663 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2023-08-30 02:51:03,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:03,863 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:51:03,863 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:51:03,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -1853689319, now seen corresponding path program 1 times
[2023-08-30 02:51:03,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:51:03,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858951651]
[2023-08-30 02:51:03,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-30 02:51:03,864 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:03,864 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:51:03,865 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:51:03,865 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2023-08-30 02:51:04,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-30 02:51:04,039 INFO  L263         TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 18 conjunts are in the unsatisfiable core
[2023-08-30 02:51:04,041 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-30 02:51:04,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-30 02:51:04,632 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-30 02:51:04,632 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-30 02:51:04,632 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858951651]
[2023-08-30 02:51:04,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858951651] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-30 02:51:04,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-30 02:51:04,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-30 02:51:04,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225502555]
[2023-08-30 02:51:04,633 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-30 02:51:04,633 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-30 02:51:04,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-30 02:51:04,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-30 02:51:04,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-30 02:51:04,953 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 275
[2023-08-30 02:51:04,957 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 432 flow. Second operand  has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:04,957 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-30 02:51:04,957 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 275
[2023-08-30 02:51:04,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-30 02:51:05,557 INFO  L130       PetriNetUnfolder]: 3136/5220 cut-off events.
[2023-08-30 02:51:05,557 INFO  L131       PetriNetUnfolder]: For 5129/5129 co-relation queries the response was YES.
[2023-08-30 02:51:05,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16639 conditions, 5220 events. 3136/5220 cut-off events. For 5129/5129 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 33178 event pairs, 953 based on Foata normal form. 16/5110 useless extension candidates. Maximal degree in co-relation 16620. Up to 4513 conditions per place. 
[2023-08-30 02:51:05,579 INFO  L137   encePairwiseOnDemand]: 270/275 looper letters, 37 selfloop transitions, 4 changer transitions 43/88 dead transitions.
[2023-08-30 02:51:05,579 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 88 transitions, 730 flow
[2023-08-30 02:51:05,580 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-08-30 02:51:05,580 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-30 02:51:05,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 697 transitions.
[2023-08-30 02:51:05,582 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4224242424242424
[2023-08-30 02:51:05,582 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 697 transitions.
[2023-08-30 02:51:05,582 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 697 transitions.
[2023-08-30 02:51:05,583 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-30 02:51:05,583 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 697 transitions.
[2023-08-30 02:51:05,584 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.16666666666667) internal successors, (697), 6 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:05,586 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:05,586 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:05,587 INFO  L175             Difference]: Start difference. First operand has 71 places, 61 transitions, 432 flow. Second operand 6 states and 697 transitions.
[2023-08-30 02:51:05,587 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 88 transitions, 730 flow
[2023-08-30 02:51:05,678 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 88 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-30 02:51:05,679 INFO  L231             Difference]: Finished difference. Result has 74 places, 40 transitions, 196 flow
[2023-08-30 02:51:05,680 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=74, PETRI_TRANSITIONS=40}
[2023-08-30 02:51:05,680 INFO  L281   CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places.
[2023-08-30 02:51:05,680 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 40 transitions, 196 flow
[2023-08-30 02:51:05,681 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-30 02:51:05,681 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-30 02:51:05,681 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, 1]
[2023-08-30 02:51:05,690 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2023-08-30 02:51:05,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:05,885 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] ===
[2023-08-30 02:51:05,885 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-30 02:51:05,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -1313889037, now seen corresponding path program 5 times
[2023-08-30 02:51:05,886 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-30 02:51:05,886 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138246947]
[2023-08-30 02:51:05,886 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-08-30 02:51:05,886 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:05,886 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-30 02:51:05,887 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-30 02:51:05,888 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2023-08-30 02:51:06,025 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-08-30 02:51:06,025 INFO  L229   tOrderPrioritization]: Conjunction of SSA is sat
[2023-08-30 02:51:06,025 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-30 02:51:06,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-30 02:51:06,171 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-08-30 02:51:06,172 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-08-30 02:51:06,172 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining)
[2023-08-30 02:51:06,174 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining)
[2023-08-30 02:51:06,174 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining)
[2023-08-30 02:51:06,174 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining)
[2023-08-30 02:51:06,175 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining)
[2023-08-30 02:51:06,175 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining)
[2023-08-30 02:51:06,175 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining)
[2023-08-30 02:51:06,175 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining)
[2023-08-30 02:51:06,175 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining)
[2023-08-30 02:51:06,175 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining)
[2023-08-30 02:51:06,175 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining)
[2023-08-30 02:51:06,176 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining)
[2023-08-30 02:51:06,176 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining)
[2023-08-30 02:51:06,176 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining)
[2023-08-30 02:51:06,176 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining)
[2023-08-30 02:51:06,176 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining)
[2023-08-30 02:51:06,190 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0
[2023-08-30 02:51:06,388 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-30 02:51:06,388 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1]
[2023-08-30 02:51:06,393 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-30 02:51:06,393 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-08-30 02:51:06,488 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 02:51:06 BasicIcfg
[2023-08-30 02:51:06,489 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-30 02:51:06,489 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-30 02:51:06,489 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-08-30 02:51:06,489 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-08-30 02:51:06,490 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 02:50:45" (3/4) ...
[2023-08-30 02:51:06,495 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-08-30 02:51:06,495 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-30 02:51:06,496 INFO  L158              Benchmark]: Toolchain (without parser) took 22682.49ms. Allocated memory was 71.3MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 47.4MB in the beginning and 815.1MB in the end (delta: -767.7MB). Peak memory consumption was 602.7MB. Max. memory is 16.1GB.
[2023-08-30 02:51:06,496 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 02:51:06,497 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 582.98ms. Allocated memory is still 71.3MB. Free memory was 47.2MB in the beginning and 39.5MB in the end (delta: 7.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2023-08-30 02:51:06,497 INFO  L158              Benchmark]: Boogie Procedure Inliner took 55.06ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 02:51:06,497 INFO  L158              Benchmark]: Boogie Preprocessor took 29.69ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 34.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-30 02:51:06,498 INFO  L158              Benchmark]: RCFGBuilder took 795.34ms. Allocated memory is still 71.3MB. Free memory was 34.9MB in the beginning and 34.0MB in the end (delta: 907.6kB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB.
[2023-08-30 02:51:06,498 INFO  L158              Benchmark]: TraceAbstraction took 21206.00ms. Allocated memory was 71.3MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 33.5MB in the beginning and 815.1MB in the end (delta: -781.6MB). Peak memory consumption was 585.0MB. Max. memory is 16.1GB.
[2023-08-30 02:51:06,498 INFO  L158              Benchmark]: Witness Printer took 5.92ms. Allocated memory is still 1.4GB. Free memory is still 815.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-30 02:51:06,499 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.16ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 582.98ms. Allocated memory is still 71.3MB. Free memory was 47.2MB in the beginning and 39.5MB in the end (delta: 7.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 55.06ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 29.69ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 34.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 795.34ms. Allocated memory is still 71.3MB. Free memory was 34.9MB in the beginning and 34.0MB in the end (delta: 907.6kB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 21206.00ms. Allocated memory was 71.3MB in the beginning and 1.4GB in the end (delta: 1.4GB). Free memory was 33.5MB in the beginning and 815.1MB in the end (delta: -781.6MB). Peak memory consumption was 585.0MB. Max. memory is 16.1GB.
 * Witness Printer took 5.92ms. Allocated memory is still 1.4GB. Free memory is still 815.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.1s, 150 PlacesBefore, 52 PlacesAfterwards, 139 TransitionsBefore, 40 TransitionsAfterwards, 3338 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 9453 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4055, independent: 3824, independent conditional: 0, independent unconditional: 3824, dependent: 231, dependent conditional: 0, dependent unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1680, independent: 1645, independent conditional: 0, independent unconditional: 1645, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4055, independent: 2179, independent conditional: 0, independent unconditional: 2179, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1680, unknown conditional: 0, unknown unconditional: 1680] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 168, Positive conditional cache size: 0, Positive unconditional cache size: 168, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 19. 
Possible FailurePath: 
[L711]               0  int __unbuffered_cnt = 0;
[L713]               0  int __unbuffered_p0_EAX = 0;
[L715]               0  int __unbuffered_p1_EAX = 0;
[L717]               0  int __unbuffered_p3_EAX = 0;
[L719]               0  int __unbuffered_p3_EBX = 0;
[L721]               0  int a = 0;
[L722]               0  _Bool main$tmp_guard0;
[L723]               0  _Bool main$tmp_guard1;
[L725]               0  int x = 0;
[L726]               0  _Bool x$flush_delayed;
[L727]               0  int x$mem_tmp;
[L728]               0  _Bool x$r_buff0_thd0;
[L729]               0  _Bool x$r_buff0_thd1;
[L730]               0  _Bool x$r_buff0_thd2;
[L731]               0  _Bool x$r_buff0_thd3;
[L732]               0  _Bool x$r_buff0_thd4;
[L733]               0  _Bool x$r_buff1_thd0;
[L734]               0  _Bool x$r_buff1_thd1;
[L735]               0  _Bool x$r_buff1_thd2;
[L736]               0  _Bool x$r_buff1_thd3;
[L737]               0  _Bool x$r_buff1_thd4;
[L738]               0  _Bool x$read_delayed;
[L739]               0  int *x$read_delayed_var;
[L740]               0  int x$w_buff0;
[L741]               0  _Bool x$w_buff0_used;
[L742]               0  int x$w_buff1;
[L743]               0  _Bool x$w_buff1_used;
[L745]               0  int y = 0;
[L747]               0  int z = 0;
[L748]               0  _Bool weak$$choice0;
[L749]               0  _Bool weak$$choice2;
[L862]               0  pthread_t t685;
[L863]  FCALL, FORK  0  pthread_create(&t685, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=0, t685={-16:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L864]               0  pthread_t t686;
[L865]  FCALL, FORK  0  pthread_create(&t686, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=1, t685={-16:0}, t686={-12:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L781]               2  x$w_buff1 = x$w_buff0
[L782]               2  x$w_buff0 = 1
[L783]               2  x$w_buff1_used = x$w_buff0_used
[L784]               2  x$w_buff0_used = (_Bool)1
[L785]  CALL         2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L19]   COND FALSE   2  !(!expression)
[L785]  RET          2  __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L786]               2  x$r_buff1_thd0 = x$r_buff0_thd0
[L787]               2  x$r_buff1_thd1 = x$r_buff0_thd1
[L788]               2  x$r_buff1_thd2 = x$r_buff0_thd2
[L789]               2  x$r_buff1_thd3 = x$r_buff0_thd3
[L790]               2  x$r_buff1_thd4 = x$r_buff0_thd4
[L791]               2  x$r_buff0_thd2 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L866]               0  pthread_t t687;
[L867]  FCALL, FORK  0  pthread_create(&t687, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=2, t685={-16:0}, t686={-12:0}, t687={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L794]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L811]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L868]               0  pthread_t t688;
[L869]  FCALL, FORK  0  pthread_create(&t688, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=3, t685={-16:0}, t686={-12:0}, t687={-2:0}, t688={-4:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L814]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L817]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L818]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L819]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L820]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L821]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L831]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L834]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L837]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L753]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L756]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L757]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L758]               1  x$flush_delayed = weak$$choice2
[L759]               1  x$mem_tmp = x
[L760]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L761]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L762]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L763]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L764]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L765]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L766]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L767]               1  __unbuffered_p0_EAX = x
[L768]               1  x = x$flush_delayed ? x$mem_tmp : x
[L769]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L797]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L798]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L799]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L800]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L801]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L774]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L776]               1  return 0;
[L840]               4  x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L841]               4  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L842]               4  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L843]               4  x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L844]               4  x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L804]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L806]               2  return 0;
[L824]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L826]               3  return 0;
[L847]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L849]               4  return 0;
[L871]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L873]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L873]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L875]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L876]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L877]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L878]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L879]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, t685={-16:0}, t686={-12:0}, t687={-2:0}, t688={-4:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L882]               0  main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L884]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]

  - UnprovableResult [Line: 19]: 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: 860]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 865]: 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: 869]: 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: 863]: 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: 867]: 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, 179 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: 21.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 591 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 485 mSDsluCounter, 247 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2383 IncrementalHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 16 mSDtfsCounter, 2383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=10, InterpolantAutomatonStates: 59, 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.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 204 ConstructedInterpolants, 19 QuantifiedInterpolants, 2012 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1725 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-08-30 02:51:06,521 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