./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe019_rmo.oepc.i --full-output --architecture 32bit


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


Checking for memory safety (deref-memtrack)
Using default analysis
Version 3061b6dc
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/safe019_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 63f865703c59d821a54141355edec3427193a51b37abbaa1f96833fe96db9b5e
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 09:33:40,953 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 09:33:41,042 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-19 09:33:41,047 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 09:33:41,047 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 09:33:41,088 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 09:33:41,089 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 09:33:41,089 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 09:33:41,090 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 09:33:41,090 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 09:33:41,091 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 09:33:41,091 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 09:33:41,092 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 09:33:41,092 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 09:33:41,092 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 09:33:41,092 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 09:33:41,093 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 09:33:41,093 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 09:33:41,094 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 09:33:41,097 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 09:33:41,097 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-19 09:33:41,097 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-19 09:33:41,098 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-19 09:33:41,098 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 09:33:41,098 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-19 09:33:41,098 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 09:33:41,099 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-19 09:33:41,099 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 09:33:41,099 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 09:33:41,099 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 09:33:41,100 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 09:33:41,100 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 09:33:41,100 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 09:33:41,100 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 09:33:41,101 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 09:33:41,101 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 09:33:41,105 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-19 09:33:41,106 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-19 09:33:41,106 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 09:33:41,106 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 09:33:41,106 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 09:33:41,107 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 09:33:41,108 INFO  L153        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
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 -> 63f865703c59d821a54141355edec3427193a51b37abbaa1f96833fe96db9b5e
[2024-11-19 09:33:41,345 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 09:33:41,373 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 09:33:41,376 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 09:33:41,377 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 09:33:41,378 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 09:33:41,380 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_rmo.oepc.i
[2024-11-19 09:33:42,854 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 09:33:43,119 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 09:33:43,120 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.oepc.i
[2024-11-19 09:33:43,142 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ee4ec81/51f4ebde2bad46e8bfbb21d7cbb1c71a/FLAGe861a6fa0
[2024-11-19 09:33:43,418 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ee4ec81/51f4ebde2bad46e8bfbb21d7cbb1c71a
[2024-11-19 09:33:43,420 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 09:33:43,421 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 09:33:43,422 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 09:33:43,422 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 09:33:43,427 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 09:33:43,428 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:33:43" (1/1) ...
[2024-11-19 09:33:43,429 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbedd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:43, skipping insertion in model container
[2024-11-19 09:33:43,429 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:33:43" (1/1) ...
[2024-11-19 09:33:43,482 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 09:33:43,902 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:33:43,917 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 09:33:43,997 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:33:44,039 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 09:33:44,040 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44 WrapperNode
[2024-11-19 09:33:44,040 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 09:33:44,042 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 09:33:44,042 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 09:33:44,042 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 09:33:44,049 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,068 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,108 INFO  L138                Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173
[2024-11-19 09:33:44,109 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 09:33:44,109 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 09:33:44,109 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 09:33:44,110 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 09:33:44,126 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,126 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,132 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,164 INFO  L175           MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9].
[2024-11-19 09:33:44,164 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,165 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,179 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,185 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,188 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,189 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,196 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 09:33:44,197 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 09:33:44,197 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 09:33:44,197 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 09:33:44,198 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (1/1) ...
[2024-11-19 09:33:44,207 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 09:33:44,218 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 09:33:44,236 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-19 09:33:44,240 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-19 09:33:44,286 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-19 09:33:44,287 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-19 09:33:44,287 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-19 09:33:44,287 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-19 09:33:44,287 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-19 09:33:44,287 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 09:33:44,287 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-19 09:33:44,287 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-19 09:33:44,287 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-19 09:33:44,288 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-19 09:33:44,288 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-19 09:33:44,289 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-19 09:33:44,290 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-11-19 09:33:44,290 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-11-19 09:33:44,290 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-19 09:33:44,290 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-19 09:33:44,290 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-19 09:33:44,290 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 09:33:44,290 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 09:33:44,292 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-19 09:33:44,435 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 09:33:44,437 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 09:33:44,990 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-19 09:33:44,991 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 09:33:45,526 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 09:33:45,527 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-19 09:33:45,527 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:33:45 BoogieIcfgContainer
[2024-11-19 09:33:45,527 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 09:33:45,530 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 09:33:45,530 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 09:33:45,534 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 09:33:45,535 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:33:43" (1/3) ...
[2024-11-19 09:33:45,535 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8e8398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:33:45, skipping insertion in model container
[2024-11-19 09:33:45,535 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:33:44" (2/3) ...
[2024-11-19 09:33:45,537 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f8e8398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:33:45, skipping insertion in model container
[2024-11-19 09:33:45,537 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:33:45" (3/3) ...
[2024-11-19 09:33:45,538 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe019_rmo.oepc.i
[2024-11-19 09:33:45,558 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 09:33:45,558 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations.
[2024-11-19 09:33:45,558 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-19 09:33:45,687 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-19 09:33:45,728 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 92 transitions, 200 flow
[2024-11-19 09:33:45,784 INFO  L124   PetriNetUnfolderBase]: 2/88 cut-off events.
[2024-11-19 09:33:45,784 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:33:45,793 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 304 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. 
[2024-11-19 09:33:45,794 INFO  L82        GeneralOperation]: Start removeDead. Operand has 103 places, 92 transitions, 200 flow
[2024-11-19 09:33:45,798 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 99 places, 88 transitions, 188 flow
[2024-11-19 09:33:45,810 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 09:33:45,818 INFO  L333      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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@62cc6f5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 09:33:45,819 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 72 error locations.
[2024-11-19 09:33:45,825 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-19 09:33:45,825 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-19 09:33:45,825 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:33:45,825 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:45,826 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-19 09:33:45,827 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:45,833 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:45,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 24803383, now seen corresponding path program 1 times
[2024-11-19 09:33:45,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:45,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65584941]
[2024-11-19 09:33:45,845 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:45,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:46,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:46,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:46,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:46,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65584941]
[2024-11-19 09:33:46,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65584941] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:46,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:46,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-19 09:33:46,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256327023]
[2024-11-19 09:33:46,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:46,272 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:33:46,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:46,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:33:46,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:33:46,317 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:33:46,320 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 188 flow. Second operand  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:46,320 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:46,320 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:33:46,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:50,700 INFO  L124   PetriNetUnfolderBase]: 16139/23720 cut-off events.
[2024-11-19 09:33:50,700 INFO  L125   PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES.
[2024-11-19 09:33:50,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45628 conditions, 23720 events. 16139/23720 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 189373 event pairs, 16139 based on Foata normal form. 784/16286 useless extension candidates. Maximal degree in co-relation 45616. Up to 21764 conditions per place. 
[2024-11-19 09:33:50,934 INFO  L140   encePairwiseOnDemand]: 59/92 looper letters, 36 selfloop transitions, 1 changer transitions 0/55 dead transitions.
[2024-11-19 09:33:50,935 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 196 flow
[2024-11-19 09:33:50,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 09:33:50,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-19 09:33:50,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions.
[2024-11-19 09:33:50,947 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.4891304347826087
[2024-11-19 09:33:50,949 INFO  L175             Difference]: Start difference. First operand has 99 places, 88 transitions, 188 flow. Second operand 3 states and 135 transitions.
[2024-11-19 09:33:50,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 196 flow
[2024-11-19 09:33:50,957 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-19 09:33:50,960 INFO  L231             Difference]: Finished difference. Result has 66 places, 55 transitions, 120 flow
[2024-11-19 09:33:50,965 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=55}
[2024-11-19 09:33:50,970 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -33 predicate places.
[2024-11-19 09:33:50,970 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 120 flow
[2024-11-19 09:33:50,971 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:50,971 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:50,971 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-19 09:33:50,971 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-19 09:33:50,972 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:50,972 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:50,973 INFO  L85        PathProgramCache]: Analyzing trace with hash 24803384, now seen corresponding path program 1 times
[2024-11-19 09:33:50,974 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:50,974 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140080329]
[2024-11-19 09:33:50,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:50,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:51,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:51,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:51,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:51,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140080329]
[2024-11-19 09:33:51,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140080329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:51,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:51,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-19 09:33:51,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951599975]
[2024-11-19 09:33:51,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:51,157 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:33:51,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:51,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:33:51,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:33:51,159 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:33:51,159 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 120 flow. Second operand  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:51,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:51,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:33:51,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:52,128 INFO  L124   PetriNetUnfolderBase]: 2831/4522 cut-off events.
[2024-11-19 09:33:52,129 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:33:52,140 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8548 conditions, 4522 events. 2831/4522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32703 event pairs, 2831 based on Foata normal form. 0/4296 useless extension candidates. Maximal degree in co-relation 8542. Up to 3954 conditions per place. 
[2024-11-19 09:33:52,161 INFO  L140   encePairwiseOnDemand]: 81/92 looper letters, 25 selfloop transitions, 1 changer transitions 1/45 dead transitions.
[2024-11-19 09:33:52,161 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 154 flow
[2024-11-19 09:33:52,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 09:33:52,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-19 09:33:52,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions.
[2024-11-19 09:33:52,165 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.37318840579710144
[2024-11-19 09:33:52,166 INFO  L175             Difference]: Start difference. First operand has 66 places, 55 transitions, 120 flow. Second operand 3 states and 103 transitions.
[2024-11-19 09:33:52,166 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 154 flow
[2024-11-19 09:33:52,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-19 09:33:52,168 INFO  L231             Difference]: Finished difference. Result has 57 places, 44 transitions, 99 flow
[2024-11-19 09:33:52,168 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=44}
[2024-11-19 09:33:52,169 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -42 predicate places.
[2024-11-19 09:33:52,170 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 99 flow
[2024-11-19 09:33:52,170 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:52,170 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:52,171 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:33:52,171 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-19 09:33:52,171 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:52,172 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:52,172 INFO  L85        PathProgramCache]: Analyzing trace with hash 849852388, now seen corresponding path program 1 times
[2024-11-19 09:33:52,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:52,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436314808]
[2024-11-19 09:33:52,173 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:52,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:52,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:52,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:52,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:52,374 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436314808]
[2024-11-19 09:33:52,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436314808] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:52,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:52,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-19 09:33:52,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438965128]
[2024-11-19 09:33:52,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:52,377 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:33:52,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:52,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:33:52,378 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:33:52,378 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:33:52,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 99 flow. Second operand  has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:52,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:52,380 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:33:52,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:53,182 INFO  L124   PetriNetUnfolderBase]: 2383/3785 cut-off events.
[2024-11-19 09:33:53,183 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:33:53,190 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7204 conditions, 3785 events. 2383/3785 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 24709 event pairs, 1171 based on Foata normal form. 0/3636 useless extension candidates. Maximal degree in co-relation 7197. Up to 2565 conditions per place. 
[2024-11-19 09:33:53,207 INFO  L140   encePairwiseOnDemand]: 88/92 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions.
[2024-11-19 09:33:53,208 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 237 flow
[2024-11-19 09:33:53,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 09:33:53,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-19 09:33:53,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions.
[2024-11-19 09:33:53,213 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.41304347826086957
[2024-11-19 09:33:53,213 INFO  L175             Difference]: Start difference. First operand has 57 places, 44 transitions, 99 flow. Second operand 3 states and 114 transitions.
[2024-11-19 09:33:53,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 237 flow
[2024-11-19 09:33:53,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-19 09:33:53,216 INFO  L231             Difference]: Finished difference. Result has 58 places, 44 transitions, 108 flow
[2024-11-19 09:33:53,217 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=58, PETRI_TRANSITIONS=44}
[2024-11-19 09:33:53,218 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -41 predicate places.
[2024-11-19 09:33:53,218 INFO  L471      AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 108 flow
[2024-11-19 09:33:53,219 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:53,219 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:53,219 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:33:53,219 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-19 09:33:53,219 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:53,220 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:53,220 INFO  L85        PathProgramCache]: Analyzing trace with hash 664443511, now seen corresponding path program 1 times
[2024-11-19 09:33:53,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:53,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519247862]
[2024-11-19 09:33:53,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:53,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:53,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:53,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:53,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:53,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519247862]
[2024-11-19 09:33:53,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519247862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:53,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:53,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:33:53,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770103595]
[2024-11-19 09:33:53,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:53,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:33:53,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:53,388 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:33:53,388 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:33:53,393 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:33:53,394 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 108 flow. Second operand  has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:53,394 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:53,394 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:33:53,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:54,084 INFO  L124   PetriNetUnfolderBase]: 2223/4145 cut-off events.
[2024-11-19 09:33:54,085 INFO  L125   PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES.
[2024-11-19 09:33:54,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 4145 events. 2223/4145 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 32670 event pairs, 535 based on Foata normal form. 0/4100 useless extension candidates. Maximal degree in co-relation 7953. Up to 2340 conditions per place. 
[2024-11-19 09:33:54,124 INFO  L140   encePairwiseOnDemand]: 89/92 looper letters, 43 selfloop transitions, 2 changer transitions 0/63 dead transitions.
[2024-11-19 09:33:54,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 240 flow
[2024-11-19 09:33:54,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 09:33:54,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-19 09:33:54,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions.
[2024-11-19 09:33:54,126 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3641304347826087
[2024-11-19 09:33:54,127 INFO  L175             Difference]: Start difference. First operand has 58 places, 44 transitions, 108 flow. Second operand 4 states and 134 transitions.
[2024-11-19 09:33:54,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 240 flow
[2024-11-19 09:33:54,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-19 09:33:54,131 INFO  L231             Difference]: Finished difference. Result has 58 places, 43 transitions, 104 flow
[2024-11-19 09:33:54,132 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=43}
[2024-11-19 09:33:54,132 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -41 predicate places.
[2024-11-19 09:33:54,132 INFO  L471      AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 104 flow
[2024-11-19 09:33:54,133 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:54,133 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:54,133 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:33:54,133 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-19 09:33:54,133 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:54,134 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:54,134 INFO  L85        PathProgramCache]: Analyzing trace with hash 664443512, now seen corresponding path program 1 times
[2024-11-19 09:33:54,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:54,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383870133]
[2024-11-19 09:33:54,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:54,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:54,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:54,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:54,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:54,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383870133]
[2024-11-19 09:33:54,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383870133] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:54,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:54,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:33:54,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569266975]
[2024-11-19 09:33:54,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:54,542 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 09:33:54,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:54,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 09:33:54,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:33:54,545 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:33:54,546 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 104 flow. Second operand  has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:54,546 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:54,546 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:33:54,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:55,106 INFO  L124   PetriNetUnfolderBase]: 2063/3337 cut-off events.
[2024-11-19 09:33:55,107 INFO  L125   PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES.
[2024-11-19 09:33:55,119 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6866 conditions, 3337 events. 2063/3337 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 21403 event pairs, 947 based on Foata normal form. 64/3388 useless extension candidates. Maximal degree in co-relation 6857. Up to 2116 conditions per place. 
[2024-11-19 09:33:55,137 INFO  L140   encePairwiseOnDemand]: 89/92 looper letters, 42 selfloop transitions, 2 changer transitions 0/62 dead transitions.
[2024-11-19 09:33:55,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 62 transitions, 234 flow
[2024-11-19 09:33:55,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 09:33:55,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-19 09:33:55,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions.
[2024-11-19 09:33:55,139 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.36141304347826086
[2024-11-19 09:33:55,139 INFO  L175             Difference]: Start difference. First operand has 58 places, 43 transitions, 104 flow. Second operand 4 states and 133 transitions.
[2024-11-19 09:33:55,139 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 62 transitions, 234 flow
[2024-11-19 09:33:55,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 229 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-19 09:33:55,141 INFO  L231             Difference]: Finished difference. Result has 57 places, 42 transitions, 99 flow
[2024-11-19 09:33:55,142 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=42}
[2024-11-19 09:33:55,142 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -42 predicate places.
[2024-11-19 09:33:55,143 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 99 flow
[2024-11-19 09:33:55,143 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 24.6) internal successors, (123), 5 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:55,143 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:55,143 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:33:55,143 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-19 09:33:55,144 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:55,144 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:55,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -1470813549, now seen corresponding path program 1 times
[2024-11-19 09:33:55,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:55,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507835475]
[2024-11-19 09:33:55,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:55,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:55,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:55,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:55,219 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:55,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507835475]
[2024-11-19 09:33:55,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507835475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:55,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:55,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-19 09:33:55,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562795988]
[2024-11-19 09:33:55,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:55,221 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:33:55,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:55,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:33:55,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:33:55,222 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 21 out of 92
[2024-11-19 09:33:55,223 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 99 flow. Second operand  has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:55,223 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:55,223 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 92
[2024-11-19 09:33:55,223 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:55,787 INFO  L124   PetriNetUnfolderBase]: 2063/3370 cut-off events.
[2024-11-19 09:33:55,788 INFO  L125   PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES.
[2024-11-19 09:33:55,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6898 conditions, 3370 events. 2063/3370 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 23493 event pairs, 2063 based on Foata normal form. 96/3432 useless extension candidates. Maximal degree in co-relation 6890. Up to 2898 conditions per place. 
[2024-11-19 09:33:55,813 INFO  L140   encePairwiseOnDemand]: 90/92 looper letters, 22 selfloop transitions, 1 changer transitions 1/41 dead transitions.
[2024-11-19 09:33:55,813 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 145 flow
[2024-11-19 09:33:55,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 09:33:55,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-19 09:33:55,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions.
[2024-11-19 09:33:55,815 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3188405797101449
[2024-11-19 09:33:55,815 INFO  L175             Difference]: Start difference. First operand has 57 places, 42 transitions, 99 flow. Second operand 3 states and 88 transitions.
[2024-11-19 09:33:55,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 145 flow
[2024-11-19 09:33:55,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-19 09:33:55,817 INFO  L231             Difference]: Finished difference. Result has 56 places, 40 transitions, 94 flow
[2024-11-19 09:33:55,817 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=40}
[2024-11-19 09:33:55,818 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -43 predicate places.
[2024-11-19 09:33:55,818 INFO  L471      AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 94 flow
[2024-11-19 09:33:55,818 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:55,819 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:55,819 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:33:55,819 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-19 09:33:55,819 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:55,820 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:55,820 INFO  L85        PathProgramCache]: Analyzing trace with hash -1470815157, now seen corresponding path program 1 times
[2024-11-19 09:33:55,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:55,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717862282]
[2024-11-19 09:33:55,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:55,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:55,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:56,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:56,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:56,118 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717862282]
[2024-11-19 09:33:56,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717862282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:56,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:56,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:33:56,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085260151]
[2024-11-19 09:33:56,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:56,120 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:33:56,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:56,121 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:33:56,122 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:33:56,127 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:33:56,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 94 flow. Second operand  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:56,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:56,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:33:56,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:57,323 INFO  L124   PetriNetUnfolderBase]: 7438/11046 cut-off events.
[2024-11-19 09:33:57,323 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:33:57,353 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22707 conditions, 11046 events. 7438/11046 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 72417 event pairs, 770 based on Foata normal form. 300/11335 useless extension candidates. Maximal degree in co-relation 22699. Up to 6691 conditions per place. 
[2024-11-19 09:33:57,387 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 51 selfloop transitions, 6 changer transitions 1/70 dead transitions.
[2024-11-19 09:33:57,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 280 flow
[2024-11-19 09:33:57,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 09:33:57,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-19 09:33:57,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions.
[2024-11-19 09:33:57,389 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.34782608695652173
[2024-11-19 09:33:57,389 INFO  L175             Difference]: Start difference. First operand has 56 places, 40 transitions, 94 flow. Second operand 4 states and 128 transitions.
[2024-11-19 09:33:57,389 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 280 flow
[2024-11-19 09:33:57,390 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 70 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-19 09:33:57,391 INFO  L231             Difference]: Finished difference. Result has 59 places, 44 transitions, 135 flow
[2024-11-19 09:33:57,391 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=59, PETRI_TRANSITIONS=44}
[2024-11-19 09:33:57,392 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -40 predicate places.
[2024-11-19 09:33:57,392 INFO  L471      AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 135 flow
[2024-11-19 09:33:57,392 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:57,393 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:57,393 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:33:57,393 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-19 09:33:57,393 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:57,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:57,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 1226106701, now seen corresponding path program 1 times
[2024-11-19 09:33:57,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:57,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627625447]
[2024-11-19 09:33:57,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:57,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:57,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:57,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:57,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:57,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627625447]
[2024-11-19 09:33:57,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627625447] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:57,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:57,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 09:33:57,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812708680]
[2024-11-19 09:33:57,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:57,632 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 09:33:57,633 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:57,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 09:33:57,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:33:57,646 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:33:57,647 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 135 flow. Second operand  has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:57,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:57,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:33:57,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:58,582 INFO  L124   PetriNetUnfolderBase]: 5806/8694 cut-off events.
[2024-11-19 09:33:58,582 INFO  L125   PetriNetUnfolderBase]: For 2109/2109 co-relation queries the response was YES.
[2024-11-19 09:33:58,601 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20738 conditions, 8694 events. 5806/8694 cut-off events. For 2109/2109 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 54228 event pairs, 294 based on Foata normal form. 282/8965 useless extension candidates. Maximal degree in co-relation 20727. Up to 4585 conditions per place. 
[2024-11-19 09:33:58,629 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 65 selfloop transitions, 10 changer transitions 1/88 dead transitions.
[2024-11-19 09:33:58,630 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 410 flow
[2024-11-19 09:33:58,630 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-19 09:33:58,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-19 09:33:58,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions.
[2024-11-19 09:33:58,631 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.35434782608695653
[2024-11-19 09:33:58,631 INFO  L175             Difference]: Start difference. First operand has 59 places, 44 transitions, 135 flow. Second operand 5 states and 163 transitions.
[2024-11-19 09:33:58,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 410 flow
[2024-11-19 09:33:58,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 399 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-19 09:33:58,635 INFO  L231             Difference]: Finished difference. Result has 63 places, 48 transitions, 187 flow
[2024-11-19 09:33:58,635 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=63, PETRI_TRANSITIONS=48}
[2024-11-19 09:33:58,636 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -36 predicate places.
[2024-11-19 09:33:58,636 INFO  L471      AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 187 flow
[2024-11-19 09:33:58,636 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:58,637 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:58,637 INFO  L204   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]
[2024-11-19 09:33:58,637 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-19 09:33:58,637 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:58,638 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:58,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 493415449, now seen corresponding path program 1 times
[2024-11-19 09:33:58,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:58,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551141979]
[2024-11-19 09:33:58,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:58,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:58,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:33:58,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:33:58,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:33:58,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551141979]
[2024-11-19 09:33:58,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551141979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:33:58,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:33:58,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-19 09:33:58,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982061597]
[2024-11-19 09:33:58,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:33:58,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-19 09:33:58,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:33:58,923 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 09:33:58,923 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-19 09:33:58,934 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:33:58,935 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 187 flow. Second operand  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:58,935 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:33:58,935 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:33:58,935 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:33:59,615 INFO  L124   PetriNetUnfolderBase]: 3561/5327 cut-off events.
[2024-11-19 09:33:59,616 INFO  L125   PetriNetUnfolderBase]: For 3900/3900 co-relation queries the response was YES.
[2024-11-19 09:33:59,627 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14214 conditions, 5327 events. 3561/5327 cut-off events. For 3900/3900 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 29230 event pairs, 149 based on Foata normal form. 204/5520 useless extension candidates. Maximal degree in co-relation 14201. Up to 1801 conditions per place. 
[2024-11-19 09:33:59,644 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 77 selfloop transitions, 14 changer transitions 1/104 dead transitions.
[2024-11-19 09:33:59,645 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 104 transitions, 539 flow
[2024-11-19 09:33:59,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:33:59,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:33:59,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions.
[2024-11-19 09:33:59,646 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.35507246376811596
[2024-11-19 09:33:59,647 INFO  L175             Difference]: Start difference. First operand has 63 places, 48 transitions, 187 flow. Second operand 6 states and 196 transitions.
[2024-11-19 09:33:59,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 104 transitions, 539 flow
[2024-11-19 09:33:59,658 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 509 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-19 09:33:59,660 INFO  L231             Difference]: Finished difference. Result has 66 places, 52 transitions, 237 flow
[2024-11-19 09:33:59,660 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=52}
[2024-11-19 09:33:59,660 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -33 predicate places.
[2024-11-19 09:33:59,661 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 237 flow
[2024-11-19 09:33:59,661 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:33:59,661 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:33:59,661 INFO  L204   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, 1, 1]
[2024-11-19 09:33:59,661 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-19 09:33:59,662 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:33:59,662 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:33:59,662 INFO  L85        PathProgramCache]: Analyzing trace with hash -1954440013, now seen corresponding path program 1 times
[2024-11-19 09:33:59,662 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:33:59,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720655553]
[2024-11-19 09:33:59,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:33:59,663 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:33:59,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:00,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:00,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:34:00,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720655553]
[2024-11-19 09:34:00,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720655553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:00,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:00,098 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-19 09:34:00,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173794386]
[2024-11-19 09:34:00,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:00,100 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-19 09:34:00,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:34:00,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-19 09:34:00,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-19 09:34:00,117 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:34:00,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 237 flow. Second operand  has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:00,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:00,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:34:00,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:00,678 INFO  L124   PetriNetUnfolderBase]: 2205/3207 cut-off events.
[2024-11-19 09:34:00,678 INFO  L125   PetriNetUnfolderBase]: For 4072/4072 co-relation queries the response was YES.
[2024-11-19 09:34:00,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9583 conditions, 3207 events. 2205/3207 cut-off events. For 4072/4072 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 15517 event pairs, 103 based on Foata normal form. 88/3284 useless extension candidates. Maximal degree in co-relation 9569. Up to 1020 conditions per place. 
[2024-11-19 09:34:00,697 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 69 selfloop transitions, 18 changer transitions 1/100 dead transitions.
[2024-11-19 09:34:00,698 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 531 flow
[2024-11-19 09:34:00,698 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-19 09:34:00,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-19 09:34:00,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 209 transitions.
[2024-11-19 09:34:00,699 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3245341614906832
[2024-11-19 09:34:00,700 INFO  L175             Difference]: Start difference. First operand has 66 places, 52 transitions, 237 flow. Second operand 7 states and 209 transitions.
[2024-11-19 09:34:00,700 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 531 flow
[2024-11-19 09:34:00,721 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 100 transitions, 485 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-19 09:34:00,723 INFO  L231             Difference]: Finished difference. Result has 69 places, 52 transitions, 247 flow
[2024-11-19 09:34:00,723 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=69, PETRI_TRANSITIONS=52}
[2024-11-19 09:34:00,724 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -30 predicate places.
[2024-11-19 09:34:00,724 INFO  L471      AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 247 flow
[2024-11-19 09:34:00,724 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:00,724 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:00,725 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:00,725 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-19 09:34:00,725 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:00,725 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:00,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 900437490, now seen corresponding path program 1 times
[2024-11-19 09:34:00,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:34:00,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938501855]
[2024-11-19 09:34:00,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:00,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:34:00,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:01,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:01,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:34:01,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938501855]
[2024-11-19 09:34:01,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938501855] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:01,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:01,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-19 09:34:01,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43472770]
[2024-11-19 09:34:01,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:01,351 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-19 09:34:01,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:34:01,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 09:34:01,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-19 09:34:01,368 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 92
[2024-11-19 09:34:01,369 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 247 flow. Second operand  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:01,369 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:01,369 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 92
[2024-11-19 09:34:01,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:02,066 INFO  L124   PetriNetUnfolderBase]: 2814/4699 cut-off events.
[2024-11-19 09:34:02,066 INFO  L125   PetriNetUnfolderBase]: For 2487/2593 co-relation queries the response was YES.
[2024-11-19 09:34:02,083 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11778 conditions, 4699 events. 2814/4699 cut-off events. For 2487/2593 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 30502 event pairs, 489 based on Foata normal form. 16/4505 useless extension candidates. Maximal degree in co-relation 11763. Up to 1648 conditions per place. 
[2024-11-19 09:34:02,093 INFO  L140   encePairwiseOnDemand]: 86/92 looper letters, 42 selfloop transitions, 3 changer transitions 18/90 dead transitions.
[2024-11-19 09:34:02,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 469 flow
[2024-11-19 09:34:02,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:02,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:02,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions.
[2024-11-19 09:34:02,095 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3333333333333333
[2024-11-19 09:34:02,095 INFO  L175             Difference]: Start difference. First operand has 69 places, 52 transitions, 247 flow. Second operand 6 states and 184 transitions.
[2024-11-19 09:34:02,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 469 flow
[2024-11-19 09:34:02,126 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 363 flow, removed 22 selfloop flow, removed 10 redundant places.
[2024-11-19 09:34:02,128 INFO  L231             Difference]: Finished difference. Result has 67 places, 53 transitions, 169 flow
[2024-11-19 09:34:02,128 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=67, PETRI_TRANSITIONS=53}
[2024-11-19 09:34:02,129 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -32 predicate places.
[2024-11-19 09:34:02,129 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 169 flow
[2024-11-19 09:34:02,130 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:02,130 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:02,130 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:02,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-19 09:34:02,130 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:02,131 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:02,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -504282788, now seen corresponding path program 2 times
[2024-11-19 09:34:02,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:34:02,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816476684]
[2024-11-19 09:34:02,132 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 09:34:02,132 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:34:02,277 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-19 09:34:02,278 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:34:04,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:04,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:34:04,611 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816476684]
[2024-11-19 09:34:04,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816476684] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:04,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:04,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-19 09:34:04,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428109284]
[2024-11-19 09:34:04,613 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:04,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-19 09:34:04,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:34:04,614 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-19 09:34:04,614 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-11-19 09:34:04,623 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:04,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 169 flow. Second operand  has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:04,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:04,625 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:04,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:05,352 INFO  L124   PetriNetUnfolderBase]: 3278/5458 cut-off events.
[2024-11-19 09:34:05,352 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-11-19 09:34:05,363 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11634 conditions, 5458 events. 3278/5458 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 37763 event pairs, 1142 based on Foata normal form. 16/4996 useless extension candidates. Maximal degree in co-relation 11621. Up to 2631 conditions per place. 
[2024-11-19 09:34:05,370 INFO  L140   encePairwiseOnDemand]: 84/92 looper letters, 29 selfloop transitions, 5 changer transitions 12/76 dead transitions.
[2024-11-19 09:34:05,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 76 transitions, 315 flow
[2024-11-19 09:34:05,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:05,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:05,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions.
[2024-11-19 09:34:05,372 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3242753623188406
[2024-11-19 09:34:05,372 INFO  L175             Difference]: Start difference. First operand has 67 places, 53 transitions, 169 flow. Second operand 6 states and 179 transitions.
[2024-11-19 09:34:05,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 76 transitions, 315 flow
[2024-11-19 09:34:05,373 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 76 transitions, 305 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:05,374 INFO  L231             Difference]: Finished difference. Result has 69 places, 56 transitions, 195 flow
[2024-11-19 09:34:05,374 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=69, PETRI_TRANSITIONS=56}
[2024-11-19 09:34:05,375 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -30 predicate places.
[2024-11-19 09:34:05,375 INFO  L471      AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 195 flow
[2024-11-19 09:34:05,375 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 24.375) internal successors, (195), 8 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:05,375 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:05,376 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:05,376 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-19 09:34:05,376 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:05,376 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:05,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -357648884, now seen corresponding path program 3 times
[2024-11-19 09:34:05,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:34:05,377 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654473058]
[2024-11-19 09:34:05,377 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 09:34:05,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:34:05,464 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-19 09:34:05,464 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:34:05,716 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:05,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:34:05,716 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654473058]
[2024-11-19 09:34:05,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654473058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:05,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:05,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-19 09:34:05,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471382183]
[2024-11-19 09:34:05,717 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:05,718 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-19 09:34:05,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:34:05,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 09:34:05,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-19 09:34:05,729 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 92
[2024-11-19 09:34:05,730 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 195 flow. Second operand  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:05,730 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:05,730 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 92
[2024-11-19 09:34:05,730 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:06,794 INFO  L124   PetriNetUnfolderBase]: 8118/13636 cut-off events.
[2024-11-19 09:34:06,795 INFO  L125   PetriNetUnfolderBase]: For 2664/2664 co-relation queries the response was YES.
[2024-11-19 09:34:06,858 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30597 conditions, 13636 events. 8118/13636 cut-off events. For 2664/2664 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 107407 event pairs, 2172 based on Foata normal form. 16/12791 useless extension candidates. Maximal degree in co-relation 30583. Up to 5433 conditions per place. 
[2024-11-19 09:34:06,873 INFO  L140   encePairwiseOnDemand]: 87/92 looper letters, 33 selfloop transitions, 1 changer transitions 38/100 dead transitions.
[2024-11-19 09:34:06,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 476 flow
[2024-11-19 09:34:06,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:06,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:06,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions.
[2024-11-19 09:34:06,874 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3351449275362319
[2024-11-19 09:34:06,874 INFO  L175             Difference]: Start difference. First operand has 69 places, 56 transitions, 195 flow. Second operand 6 states and 185 transitions.
[2024-11-19 09:34:06,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 476 flow
[2024-11-19 09:34:06,878 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 457 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:06,879 INFO  L231             Difference]: Finished difference. Result has 72 places, 55 transitions, 190 flow
[2024-11-19 09:34:06,879 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=72, PETRI_TRANSITIONS=55}
[2024-11-19 09:34:06,880 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -27 predicate places.
[2024-11-19 09:34:06,880 INFO  L471      AbstractCegarLoop]: Abstraction has has 72 places, 55 transitions, 190 flow
[2024-11-19 09:34:06,880 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:06,880 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:06,880 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:06,881 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-19 09:34:06,881 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:06,881 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:06,881 INFO  L85        PathProgramCache]: Analyzing trace with hash 1738056144, now seen corresponding path program 4 times
[2024-11-19 09:34:06,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:34:06,881 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479354453]
[2024-11-19 09:34:06,882 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 09:34:06,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:34:06,968 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 09:34:06,969 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:34:09,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:09,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-19 09:34:09,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479354453]
[2024-11-19 09:34:09,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479354453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:09,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:09,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-19 09:34:09,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196037802]
[2024-11-19 09:34:09,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:09,429 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-19 09:34:09,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-19 09:34:09,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-19 09:34:09,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-11-19 09:34:09,440 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:09,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 55 transitions, 190 flow. Second operand  has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:09,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:09,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:09,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:10,234 INFO  L124   PetriNetUnfolderBase]: 4150/7099 cut-off events.
[2024-11-19 09:34:10,234 INFO  L125   PetriNetUnfolderBase]: For 688/703 co-relation queries the response was YES.
[2024-11-19 09:34:10,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15661 conditions, 7099 events. 4150/7099 cut-off events. For 688/703 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 53252 event pairs, 1296 based on Foata normal form. 26/6506 useless extension candidates. Maximal degree in co-relation 15646. Up to 3242 conditions per place. 
[2024-11-19 09:34:10,266 INFO  L140   encePairwiseOnDemand]: 86/92 looper letters, 31 selfloop transitions, 3 changer transitions 12/76 dead transitions.
[2024-11-19 09:34:10,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 338 flow
[2024-11-19 09:34:10,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:10,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:10,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions.
[2024-11-19 09:34:10,268 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3242753623188406
[2024-11-19 09:34:10,268 INFO  L175             Difference]: Start difference. First operand has 72 places, 55 transitions, 190 flow. Second operand 6 states and 179 transitions.
[2024-11-19 09:34:10,268 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 338 flow
[2024-11-19 09:34:10,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 327 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:10,275 INFO  L231             Difference]: Finished difference. Result has 73 places, 55 transitions, 197 flow
[2024-11-19 09:34:10,275 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=73, PETRI_TRANSITIONS=55}
[2024-11-19 09:34:10,276 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -26 predicate places.
[2024-11-19 09:34:10,276 INFO  L471      AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 197 flow
[2024-11-19 09:34:10,276 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:10,276 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:10,276 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:10,276 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-19 09:34:10,277 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:10,277 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:10,277 INFO  L85        PathProgramCache]: Analyzing trace with hash -434931100, now seen corresponding path program 5 times
[2024-11-19 09:34:10,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-19 09:34:10,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492307143]
[2024-11-19 09:34:10,277 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 09:34:10,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-19 09:34:10,360 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-19 09:34:10,361 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 09:34:10,361 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 09:34:10,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 09:34:10,495 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-19 09:34:10,495 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-19 09:34:10,497 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (71 of 72 remaining)
[2024-11-19 09:34:10,498 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 72 remaining)
[2024-11-19 09:34:10,499 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 72 remaining)
[2024-11-19 09:34:10,499 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 72 remaining)
[2024-11-19 09:34:10,499 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 72 remaining)
[2024-11-19 09:34:10,499 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 72 remaining)
[2024-11-19 09:34:10,499 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 72 remaining)
[2024-11-19 09:34:10,499 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 72 remaining)
[2024-11-19 09:34:10,500 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 72 remaining)
[2024-11-19 09:34:10,500 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 72 remaining)
[2024-11-19 09:34:10,500 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 72 remaining)
[2024-11-19 09:34:10,500 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 72 remaining)
[2024-11-19 09:34:10,500 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 72 remaining)
[2024-11-19 09:34:10,501 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 72 remaining)
[2024-11-19 09:34:10,501 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 72 remaining)
[2024-11-19 09:34:10,501 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 72 remaining)
[2024-11-19 09:34:10,501 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 72 remaining)
[2024-11-19 09:34:10,501 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 72 remaining)
[2024-11-19 09:34:10,501 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 72 remaining)
[2024-11-19 09:34:10,501 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 72 remaining)
[2024-11-19 09:34:10,502 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 72 remaining)
[2024-11-19 09:34:10,502 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 72 remaining)
[2024-11-19 09:34:10,502 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 72 remaining)
[2024-11-19 09:34:10,502 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 72 remaining)
[2024-11-19 09:34:10,502 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 72 remaining)
[2024-11-19 09:34:10,502 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 72 remaining)
[2024-11-19 09:34:10,502 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 72 remaining)
[2024-11-19 09:34:10,503 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 72 remaining)
[2024-11-19 09:34:10,503 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 72 remaining)
[2024-11-19 09:34:10,503 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 72 remaining)
[2024-11-19 09:34:10,503 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 72 remaining)
[2024-11-19 09:34:10,503 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 72 remaining)
[2024-11-19 09:34:10,503 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 72 remaining)
[2024-11-19 09:34:10,504 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 72 remaining)
[2024-11-19 09:34:10,504 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 72 remaining)
[2024-11-19 09:34:10,504 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 72 remaining)
[2024-11-19 09:34:10,505 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 72 remaining)
[2024-11-19 09:34:10,506 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 72 remaining)
[2024-11-19 09:34:10,506 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 72 remaining)
[2024-11-19 09:34:10,506 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 72 remaining)
[2024-11-19 09:34:10,506 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 72 remaining)
[2024-11-19 09:34:10,506 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 72 remaining)
[2024-11-19 09:34:10,506 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 72 remaining)
[2024-11-19 09:34:10,506 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (28 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 72 remaining)
[2024-11-19 09:34:10,507 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 72 remaining)
[2024-11-19 09:34:10,508 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 72 remaining)
[2024-11-19 09:34:10,509 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 72 remaining)
[2024-11-19 09:34:10,509 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 72 remaining)
[2024-11-19 09:34:10,509 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 72 remaining)
[2024-11-19 09:34:10,509 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 72 remaining)
[2024-11-19 09:34:10,509 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 72 remaining)
[2024-11-19 09:34:10,509 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-19 09:34:10,509 INFO  L407         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:10,649 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-19 09:34:10,650 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 09:34:10,658 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:34:10 BasicIcfg
[2024-11-19 09:34:10,658 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 09:34:10,659 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 09:34:10,659 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-19 09:34:10,659 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-19 09:34:10,660 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:33:45" (3/4) ...
[2024-11-19 09:34:10,661 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-19 09:34:10,663 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 09:34:10,663 INFO  L158              Benchmark]: Toolchain (without parser) took 27242.35ms. Allocated memory was 201.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 170.9MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 858.5MB. Max. memory is 16.1GB.
[2024-11-19 09:34:10,663 INFO  L158              Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 09:34:10,664 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 618.98ms. Allocated memory is still 201.3MB. Free memory was 170.9MB in the beginning and 142.8MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2024-11-19 09:34:10,664 INFO  L158              Benchmark]: Boogie Procedure Inliner took 67.24ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 139.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-19 09:34:10,664 INFO  L158              Benchmark]: Boogie Preprocessor took 87.03ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 135.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-19 09:34:10,664 INFO  L158              Benchmark]: RCFGBuilder took 1330.59ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 122.2MB in the end (delta: 13.0MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB.
[2024-11-19 09:34:10,665 INFO  L158              Benchmark]: TraceAbstraction took 25128.78ms. Allocated memory was 201.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 121.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 809.0MB. Max. memory is 16.1GB.
[2024-11-19 09:34:10,665 INFO  L158              Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 3.7GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 09:34:10,666 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 618.98ms. Allocated memory is still 201.3MB. Free memory was 170.9MB in the beginning and 142.8MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 67.24ms. Allocated memory is still 201.3MB. Free memory was 142.8MB in the beginning and 139.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 87.03ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 135.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1330.59ms. Allocated memory is still 201.3MB. Free memory was 135.2MB in the beginning and 122.2MB in the end (delta: 13.0MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 25128.78ms. Allocated memory was 201.3MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 121.2MB in the beginning and 2.9GB in the end (delta: -2.7GB). Peak memory consumption was 809.0MB. Max. memory is 16.1GB.
 * Witness Printer took 3.72ms. Allocated memory is still 3.7GB. Free memory is still 2.9GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 18. 
Possible FailurePath: 
[L711]               0  int __unbuffered_cnt = 0;
[L713]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  _Bool __unbuffered_p0_EAX$flush_delayed;
[L715]               0  int __unbuffered_p0_EAX$mem_tmp;
[L716]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L717]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L718]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L719]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L720]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd4;
[L721]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L722]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L723]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L724]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L725]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd4;
[L726]               0  _Bool __unbuffered_p0_EAX$read_delayed;
[L727]               0  int *__unbuffered_p0_EAX$read_delayed_var;
[L728]               0  int __unbuffered_p0_EAX$w_buff0;
[L729]               0  _Bool __unbuffered_p0_EAX$w_buff0_used;
[L730]               0  int __unbuffered_p0_EAX$w_buff1;
[L731]               0  _Bool __unbuffered_p0_EAX$w_buff1_used;
[L733]               0  int __unbuffered_p0_EBX = 0;
[L735]               0  int __unbuffered_p2_EAX = 0;
[L736]               0  _Bool main$tmp_guard0;
[L737]               0  _Bool main$tmp_guard1;
[L739]               0  int x = 0;
[L741]               0  int y = 0;
[L741]               0  int y = 0;
[L742]               0  _Bool y$flush_delayed;
[L743]               0  int y$mem_tmp;
[L744]               0  _Bool y$r_buff0_thd0;
[L745]               0  _Bool y$r_buff0_thd1;
[L746]               0  _Bool y$r_buff0_thd2;
[L747]               0  _Bool y$r_buff0_thd3;
[L748]               0  _Bool y$r_buff0_thd4;
[L749]               0  _Bool y$r_buff1_thd0;
[L750]               0  _Bool y$r_buff1_thd1;
[L751]               0  _Bool y$r_buff1_thd2;
[L752]               0  _Bool y$r_buff1_thd3;
[L753]               0  _Bool y$r_buff1_thd4;
[L754]               0  _Bool y$read_delayed;
[L755]               0  int *y$read_delayed_var;
[L756]               0  int y$w_buff0;
[L757]               0  _Bool y$w_buff0_used;
[L758]               0  int y$w_buff1;
[L759]               0  _Bool y$w_buff1_used;
[L760]               0  _Bool weak$$choice0;
[L761]               0  _Bool weak$$choice1;
[L762]               0  _Bool weak$$choice2;
[L853]               0  pthread_t t2241;
[L854]  FCALL, FORK  0  pthread_create(&t2241, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2241=-4, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L766]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L767]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L768]               1  y$flush_delayed = weak$$choice2
[L769]  EXPR         1  \read(y)
[L769]               1  y$mem_tmp = y
[L770]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L770]  EXPR         1  \read(y)
[L770]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L770]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L771]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L772]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L773]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L774]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L775]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L776]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L777]               1  __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L778]               1  __unbuffered_p0_EAX$read_delayed_var = &y
[L779]  EXPR         1  \read(y)
[L779]               1  __unbuffered_p0_EAX = y
[L780]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L780]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L780]               1  y = y$flush_delayed ? y$mem_tmp : y
[L781]               1  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L855]               0  pthread_t t2242;
[L856]  FCALL, FORK  0  pthread_create(&t2242, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241=-4, t2242=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L857]               0  pthread_t t2243;
[L858]  FCALL, FORK  0  pthread_create(&t2243, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241=-4, t2242=-3, t2243=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L784]               1  __unbuffered_p0_EBX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L796]               2  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L808]               3  __unbuffered_p2_EAX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L859]               0  pthread_t t2244;
[L860]  FCALL, FORK  0  pthread_create(&t2244, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241=-4, t2242=-3, t2243=-2, t2244=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L811]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L814]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L814]  EXPR         3  \read(y)
[L814]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L814]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L815]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L816]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L817]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L818]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L828]               4  y = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L831]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L831]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L831]  EXPR         4  \read(y)
[L831]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L831]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L831]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L832]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L833]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L834]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L835]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L789]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L801]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L838]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L821]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L862]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241=-4, t2242=-3, t2243=-2, t2244=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L864]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L864]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L866]  EXPR         0  \read(y)
[L866]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L867]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L868]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L869]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L870]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241=-4, t2242=-3, t2243=-2, t2244=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L873]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L874]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L875]               0  y$flush_delayed = weak$$choice2
[L876]  EXPR         0  \read(y)
[L876]               0  y$mem_tmp = y
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  \read(y)
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L878]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L879]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L880]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L881]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L883]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L884]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L885]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L885]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L885]  EXPR         0  \read(*__unbuffered_p0_EAX$read_delayed_var)
[L885]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L885]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L885]               0  __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L886]  EXPR         0  \read(y)
[L886]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
[L887]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L887]  EXPR         0  \read(y)
[L887]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L887]               0  y = y$flush_delayed ? y$mem_tmp : y
[L888]               0  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241=-4, t2242=-3, t2243=-2, t2244=-1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L890]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
[L19]   CALL         0  reach_error()
[L18]   COND FALSE   0  !(0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L18]                0  __assert_fail ("0", "safe019_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]

  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 145 locations, 72 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: 24.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 785 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 742 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 14 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 66, 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.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 1886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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
[2024-11-19 09:34:10,699 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/safe019_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 63f865703c59d821a54141355edec3427193a51b37abbaa1f96833fe96db9b5e
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m
[2024-11-19 09:34:13,369 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-19 09:34:13,454 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-19 09:34:13,459 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-19 09:34:13,461 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-19 09:34:13,494 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-19 09:34:13,495 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-19 09:34:13,495 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-19 09:34:13,496 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-19 09:34:13,496 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-19 09:34:13,496 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-19 09:34:13,497 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-19 09:34:13,497 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-19 09:34:13,498 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-19 09:34:13,499 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-19 09:34:13,499 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-19 09:34:13,499 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-19 09:34:13,500 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-19 09:34:13,500 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-19 09:34:13,500 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-19 09:34:13,501 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-19 09:34:13,501 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-19 09:34:13,501 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-19 09:34:13,502 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-19 09:34:13,502 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-19 09:34:13,502 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-19 09:34:13,503 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-19 09:34:13,503 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-19 09:34:13,503 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-19 09:34:13,503 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-19 09:34:13,504 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-19 09:34:13,504 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-19 09:34:13,504 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-19 09:34:13,505 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-19 09:34:13,505 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-19 09:34:13,510 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 09:34:13,510 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-19 09:34:13,510 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-19 09:34:13,511 INFO  L153        SettingsManager]:  * Trace refinement strategy=WOLF
[2024-11-19 09:34:13,511 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-19 09:34:13,511 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-19 09:34:13,511 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-19 09:34:13,512 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-19 09:34:13,512 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-19 09:34:13,512 INFO  L153        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
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 -> 63f865703c59d821a54141355edec3427193a51b37abbaa1f96833fe96db9b5e
[2024-11-19 09:34:13,828 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-19 09:34:13,851 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-19 09:34:13,854 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-19 09:34:13,856 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-19 09:34:13,856 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-19 09:34:13,858 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe019_rmo.oepc.i
[2024-11-19 09:34:15,512 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-19 09:34:15,784 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-19 09:34:15,785 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe019_rmo.oepc.i
[2024-11-19 09:34:15,814 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7c1c3a/846f4ba523424bf4bb1cb53220f2cee3/FLAG396d408d4
[2024-11-19 09:34:15,828 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ec7c1c3a/846f4ba523424bf4bb1cb53220f2cee3
[2024-11-19 09:34:15,831 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-19 09:34:15,832 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-19 09:34:15,833 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-19 09:34:15,833 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-19 09:34:15,838 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-19 09:34:15,839 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:15" (1/1) ...
[2024-11-19 09:34:15,842 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4547ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:15, skipping insertion in model container
[2024-11-19 09:34:15,842 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:34:15" (1/1) ...
[2024-11-19 09:34:15,891 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-19 09:34:16,373 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:34:16,393 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-19 09:34:16,472 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-19 09:34:16,526 INFO  L204         MainTranslator]: Completed translation
[2024-11-19 09:34:16,527 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16 WrapperNode
[2024-11-19 09:34:16,527 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-19 09:34:16,528 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-19 09:34:16,528 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-19 09:34:16,528 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-19 09:34:16,534 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,562 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,600 INFO  L138                Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174
[2024-11-19 09:34:16,601 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-19 09:34:16,602 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-19 09:34:16,602 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-19 09:34:16,602 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-19 09:34:16,613 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,614 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,620 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,656 INFO  L175           MemorySlicer]: Split 24 memory accesses to 2 slices as follows [22, 2]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 9 writes are split as follows [9, 0].
[2024-11-19 09:34:16,657 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,657 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,675 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,684 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,696 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,702 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,709 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-19 09:34:16,710 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-19 09:34:16,710 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-19 09:34:16,710 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-19 09:34:16,711 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (1/1) ...
[2024-11-19 09:34:16,718 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-19 09:34:16,729 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-19 09:34:16,746 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-19 09:34:16,753 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-19 09:34:16,804 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-19 09:34:16,804 INFO  L130     BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-19 09:34:16,804 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-19 09:34:16,804 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-19 09:34:16,805 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-19 09:34:16,805 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-19 09:34:16,805 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-19 09:34:16,805 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-19 09:34:16,805 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0
[2024-11-19 09:34:16,806 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1
[2024-11-19 09:34:16,807 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-19 09:34:16,807 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-19 09:34:16,807 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-19 09:34:16,807 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-19 09:34:16,808 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-19 09:34:16,808 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-19 09:34:16,808 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2024-11-19 09:34:16,808 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2024-11-19 09:34:16,808 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-19 09:34:16,808 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-19 09:34:16,809 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-19 09:34:16,811 WARN  L207             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-19 09:34:17,033 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-19 09:34:17,035 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-19 09:34:17,772 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-19 09:34:17,773 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-19 09:34:18,398 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-19 09:34:18,398 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-19 09:34:18,398 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:18 BoogieIcfgContainer
[2024-11-19 09:34:18,399 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-19 09:34:18,402 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-19 09:34:18,402 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-19 09:34:18,405 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-19 09:34:18,405 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:34:15" (1/3) ...
[2024-11-19 09:34:18,406 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9924f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:18, skipping insertion in model container
[2024-11-19 09:34:18,406 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:34:16" (2/3) ...
[2024-11-19 09:34:18,407 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9924f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:34:18, skipping insertion in model container
[2024-11-19 09:34:18,408 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:18" (3/3) ...
[2024-11-19 09:34:18,409 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe019_rmo.oepc.i
[2024-11-19 09:34:18,427 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-19 09:34:18,427 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations.
[2024-11-19 09:34:18,427 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-19 09:34:18,626 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-19 09:34:18,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 92 transitions, 200 flow
[2024-11-19 09:34:18,727 INFO  L124   PetriNetUnfolderBase]: 2/88 cut-off events.
[2024-11-19 09:34:18,727 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:34:18,734 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 304 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. 
[2024-11-19 09:34:18,734 INFO  L82        GeneralOperation]: Start removeDead. Operand has 103 places, 92 transitions, 200 flow
[2024-11-19 09:34:18,739 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 99 places, 88 transitions, 188 flow
[2024-11-19 09:34:18,752 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-19 09:34:18,759 INFO  L333      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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@433c432, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-19 09:34:18,760 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 72 error locations.
[2024-11-19 09:34:18,764 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-19 09:34:18,765 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-19 09:34:18,765 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:34:18,765 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:18,766 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-19 09:34:18,767 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:18,772 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:18,773 INFO  L85        PathProgramCache]: Analyzing trace with hash 24864951, now seen corresponding path program 1 times
[2024-11-19 09:34:18,786 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:18,786 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357838957]
[2024-11-19 09:34:18,786 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:18,787 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
[2024-11-19 09:34:18,787 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:18,790 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)
[2024-11-19 09:34:18,792 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
[2024-11-19 09:34:18,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:18,964 INFO  L255         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:18,968 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:19,045 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:19,046 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:19,046 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:19,047 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357838957]
[2024-11-19 09:34:19,047 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [357838957] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:19,047 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:19,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-19 09:34:19,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507104557]
[2024-11-19 09:34:19,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:19,057 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:34:19,063 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:19,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:34:19,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:34:19,094 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:19,097 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 188 flow. Second operand  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:19,097 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:19,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:19,099 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:23,317 INFO  L124   PetriNetUnfolderBase]: 16139/23720 cut-off events.
[2024-11-19 09:34:23,318 INFO  L125   PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES.
[2024-11-19 09:34:23,419 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45628 conditions, 23720 events. 16139/23720 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 189373 event pairs, 16139 based on Foata normal form. 784/16286 useless extension candidates. Maximal degree in co-relation 45616. Up to 21764 conditions per place. 
[2024-11-19 09:34:23,770 INFO  L140   encePairwiseOnDemand]: 59/92 looper letters, 36 selfloop transitions, 1 changer transitions 0/55 dead transitions.
[2024-11-19 09:34:23,770 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 196 flow
[2024-11-19 09:34:23,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 09:34:23,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-19 09:34:23,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions.
[2024-11-19 09:34:23,785 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.4891304347826087
[2024-11-19 09:34:23,787 INFO  L175             Difference]: Start difference. First operand has 99 places, 88 transitions, 188 flow. Second operand 3 states and 135 transitions.
[2024-11-19 09:34:23,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 196 flow
[2024-11-19 09:34:23,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:23,802 INFO  L231             Difference]: Finished difference. Result has 66 places, 55 transitions, 120 flow
[2024-11-19 09:34:23,804 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=55}
[2024-11-19 09:34:23,809 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -33 predicate places.
[2024-11-19 09:34:23,810 INFO  L471      AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 120 flow
[2024-11-19 09:34:23,810 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:23,810 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:23,810 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-19 09:34:23,815 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-19 09:34:24,014 WARN  L453      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
[2024-11-19 09:34:24,015 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:24,016 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:24,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 24864952, now seen corresponding path program 1 times
[2024-11-19 09:34:24,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:24,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565166223]
[2024-11-19 09:34:24,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:24,017 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-19 09:34:24,017 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:24,022 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)
[2024-11-19 09:34:24,024 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
[2024-11-19 09:34:24,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:24,139 INFO  L255         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:24,141 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:24,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:24,180 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:24,180 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:24,180 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565166223]
[2024-11-19 09:34:24,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [565166223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:24,181 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:24,181 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-19 09:34:24,181 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97572249]
[2024-11-19 09:34:24,181 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:24,182 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:34:24,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:24,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:34:24,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:34:24,184 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:24,184 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 120 flow. Second operand  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:24,187 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:24,187 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:24,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:25,029 INFO  L124   PetriNetUnfolderBase]: 2831/4522 cut-off events.
[2024-11-19 09:34:25,029 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:34:25,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8548 conditions, 4522 events. 2831/4522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 32703 event pairs, 2831 based on Foata normal form. 0/4296 useless extension candidates. Maximal degree in co-relation 8542. Up to 3954 conditions per place. 
[2024-11-19 09:34:25,057 INFO  L140   encePairwiseOnDemand]: 81/92 looper letters, 25 selfloop transitions, 1 changer transitions 1/45 dead transitions.
[2024-11-19 09:34:25,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 154 flow
[2024-11-19 09:34:25,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 09:34:25,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-19 09:34:25,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions.
[2024-11-19 09:34:25,059 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.37318840579710144
[2024-11-19 09:34:25,059 INFO  L175             Difference]: Start difference. First operand has 66 places, 55 transitions, 120 flow. Second operand 3 states and 103 transitions.
[2024-11-19 09:34:25,059 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 154 flow
[2024-11-19 09:34:25,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 153 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-19 09:34:25,061 INFO  L231             Difference]: Finished difference. Result has 57 places, 44 transitions, 99 flow
[2024-11-19 09:34:25,061 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=57, PETRI_TRANSITIONS=44}
[2024-11-19 09:34:25,062 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -42 predicate places.
[2024-11-19 09:34:25,062 INFO  L471      AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 99 flow
[2024-11-19 09:34:25,063 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:25,063 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:25,063 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:25,069 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-19 09:34:25,263 WARN  L453      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
[2024-11-19 09:34:25,264 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:25,264 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:25,265 INFO  L85        PathProgramCache]: Analyzing trace with hash -1760831898, now seen corresponding path program 1 times
[2024-11-19 09:34:25,265 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:25,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700290374]
[2024-11-19 09:34:25,266 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:25,266 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
[2024-11-19 09:34:25,266 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:25,267 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)
[2024-11-19 09:34:25,268 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
[2024-11-19 09:34:25,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:25,417 INFO  L255         TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:25,418 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:25,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:25,467 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:25,467 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:25,467 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700290374]
[2024-11-19 09:34:25,467 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [700290374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:25,467 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:25,467 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-19 09:34:25,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266807176]
[2024-11-19 09:34:25,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:25,468 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:34:25,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:25,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:34:25,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:34:25,487 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:34:25,488 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 99 flow. Second operand  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:25,488 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:25,489 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:34:25,489 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:27,445 INFO  L124   PetriNetUnfolderBase]: 9937/14673 cut-off events.
[2024-11-19 09:34:27,445 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:34:27,515 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28360 conditions, 14673 events. 9937/14673 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 98951 event pairs, 770 based on Foata normal form. 300/14398 useless extension candidates. Maximal degree in co-relation 28353. Up to 10036 conditions per place. 
[2024-11-19 09:34:27,582 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 54 selfloop transitions, 6 changer transitions 1/74 dead transitions.
[2024-11-19 09:34:27,583 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 287 flow
[2024-11-19 09:34:27,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 09:34:27,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-19 09:34:27,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2024-11-19 09:34:27,587 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.35597826086956524
[2024-11-19 09:34:27,588 INFO  L175             Difference]: Start difference. First operand has 57 places, 44 transitions, 99 flow. Second operand 4 states and 131 transitions.
[2024-11-19 09:34:27,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 287 flow
[2024-11-19 09:34:27,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-19 09:34:27,592 INFO  L231             Difference]: Finished difference. Result has 60 places, 48 transitions, 140 flow
[2024-11-19 09:34:27,592 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=60, PETRI_TRANSITIONS=48}
[2024-11-19 09:34:27,593 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -39 predicate places.
[2024-11-19 09:34:27,593 INFO  L471      AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 140 flow
[2024-11-19 09:34:27,594 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:27,594 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:27,594 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:27,599 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-19 09:34:27,795 WARN  L453      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
[2024-11-19 09:34:27,796 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:27,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:27,797 INFO  L85        PathProgramCache]: Analyzing trace with hash -1257883388, now seen corresponding path program 1 times
[2024-11-19 09:34:27,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:27,801 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132001837]
[2024-11-19 09:34:27,802 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:27,802 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
[2024-11-19 09:34:27,802 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:27,807 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)
[2024-11-19 09:34:27,808 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-19 09:34:27,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:27,951 INFO  L255         TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:27,953 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:28,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:28,004 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:28,004 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:28,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132001837]
[2024-11-19 09:34:28,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132001837] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:28,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:28,005 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-19 09:34:28,005 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486098488]
[2024-11-19 09:34:28,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:28,006 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-19 09:34:28,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:28,006 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-19 09:34:28,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-19 09:34:28,021 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:34:28,022 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 140 flow. Second operand  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:28,022 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:28,022 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:34:28,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:29,798 INFO  L124   PetriNetUnfolderBase]: 7486/11190 cut-off events.
[2024-11-19 09:34:29,798 INFO  L125   PetriNetUnfolderBase]: For 2529/2529 co-relation queries the response was YES.
[2024-11-19 09:34:29,839 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25005 conditions, 11190 events. 7486/11190 cut-off events. For 2529/2529 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 72296 event pairs, 294 based on Foata normal form. 282/11053 useless extension candidates. Maximal degree in co-relation 24995. Up to 6877 conditions per place. 
[2024-11-19 09:34:29,880 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 68 selfloop transitions, 10 changer transitions 1/92 dead transitions.
[2024-11-19 09:34:29,880 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 415 flow
[2024-11-19 09:34:29,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-19 09:34:29,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-19 09:34:29,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions.
[2024-11-19 09:34:29,885 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.36086956521739133
[2024-11-19 09:34:29,885 INFO  L175             Difference]: Start difference. First operand has 60 places, 48 transitions, 140 flow. Second operand 5 states and 166 transitions.
[2024-11-19 09:34:29,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 415 flow
[2024-11-19 09:34:29,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 404 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-19 09:34:29,892 INFO  L231             Difference]: Finished difference. Result has 64 places, 52 transitions, 192 flow
[2024-11-19 09:34:29,893 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=64, PETRI_TRANSITIONS=52}
[2024-11-19 09:34:29,894 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -35 predicate places.
[2024-11-19 09:34:29,894 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 192 flow
[2024-11-19 09:34:29,895 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:29,895 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:29,895 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:29,901 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
[2024-11-19 09:34:30,095 WARN  L453      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
[2024-11-19 09:34:30,096 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:30,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:30,097 INFO  L85        PathProgramCache]: Analyzing trace with hash -1765821388, now seen corresponding path program 1 times
[2024-11-19 09:34:30,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:30,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800942822]
[2024-11-19 09:34:30,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:30,098 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
[2024-11-19 09:34:30,098 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:30,100 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)
[2024-11-19 09:34:30,101 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
[2024-11-19 09:34:30,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:30,252 INFO  L255         TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:30,254 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:30,331 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:30,331 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:30,332 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:30,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800942822]
[2024-11-19 09:34:30,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800942822] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:30,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:30,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-19 09:34:30,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171456535]
[2024-11-19 09:34:30,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:30,337 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-19 09:34:30,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:30,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 09:34:30,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-19 09:34:30,352 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:34:30,353 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 192 flow. Second operand  has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:30,353 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:30,353 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:34:30,353 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:31,150 INFO  L124   PetriNetUnfolderBase]: 4197/6315 cut-off events.
[2024-11-19 09:34:31,150 INFO  L125   PetriNetUnfolderBase]: For 4188/4188 co-relation queries the response was YES.
[2024-11-19 09:34:31,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15749 conditions, 6315 events. 4197/6315 cut-off events. For 4188/4188 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 35934 event pairs, 149 based on Foata normal form. 204/6332 useless extension candidates. Maximal degree in co-relation 15737. Up to 2701 conditions per place. 
[2024-11-19 09:34:31,192 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 80 selfloop transitions, 14 changer transitions 1/108 dead transitions.
[2024-11-19 09:34:31,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 542 flow
[2024-11-19 09:34:31,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:31,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:31,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions.
[2024-11-19 09:34:31,194 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3605072463768116
[2024-11-19 09:34:31,194 INFO  L175             Difference]: Start difference. First operand has 64 places, 52 transitions, 192 flow. Second operand 6 states and 199 transitions.
[2024-11-19 09:34:31,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 542 flow
[2024-11-19 09:34:31,210 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 108 transitions, 512 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:31,212 INFO  L231             Difference]: Finished difference. Result has 67 places, 56 transitions, 242 flow
[2024-11-19 09:34:31,212 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=67, PETRI_TRANSITIONS=56}
[2024-11-19 09:34:31,215 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -32 predicate places.
[2024-11-19 09:34:31,215 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 242 flow
[2024-11-19 09:34:31,215 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:31,216 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:31,216 INFO  L204   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]
[2024-11-19 09:34:31,223 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 (6)] Ended with exit code 0
[2024-11-19 09:34:31,416 WARN  L453      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
[2024-11-19 09:34:31,417 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:31,418 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:31,419 INFO  L85        PathProgramCache]: Analyzing trace with hash -1353659630, now seen corresponding path program 1 times
[2024-11-19 09:34:31,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:31,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131369740]
[2024-11-19 09:34:31,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:31,420 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
[2024-11-19 09:34:31,420 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:31,423 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)
[2024-11-19 09:34:31,424 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
[2024-11-19 09:34:31,582 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:31,586 INFO  L255         TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:31,589 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:31,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:31,663 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:31,664 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:31,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131369740]
[2024-11-19 09:34:31,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131369740] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:31,664 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:31,664 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-19 09:34:31,664 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52102513]
[2024-11-19 09:34:31,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:31,664 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-19 09:34:31,665 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:31,665 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-19 09:34:31,665 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-19 09:34:31,679 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 92
[2024-11-19 09:34:31,679 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 242 flow. Second operand  has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:31,679 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:31,680 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 92
[2024-11-19 09:34:31,680 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:32,312 INFO  L124   PetriNetUnfolderBase]: 2301/3367 cut-off events.
[2024-11-19 09:34:32,312 INFO  L125   PetriNetUnfolderBase]: For 4072/4072 co-relation queries the response was YES.
[2024-11-19 09:34:32,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9494 conditions, 3367 events. 2301/3367 cut-off events. For 4072/4072 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 16296 event pairs, 103 based on Foata normal form. 88/3412 useless extension candidates. Maximal degree in co-relation 9481. Up to 1020 conditions per place. 
[2024-11-19 09:34:32,334 INFO  L140   encePairwiseOnDemand]: 85/92 looper letters, 72 selfloop transitions, 18 changer transitions 1/104 dead transitions.
[2024-11-19 09:34:32,334 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 104 transitions, 536 flow
[2024-11-19 09:34:32,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-19 09:34:32,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-19 09:34:32,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 212 transitions.
[2024-11-19 09:34:32,336 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.32919254658385094
[2024-11-19 09:34:32,336 INFO  L175             Difference]: Start difference. First operand has 67 places, 56 transitions, 242 flow. Second operand 7 states and 212 transitions.
[2024-11-19 09:34:32,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 104 transitions, 536 flow
[2024-11-19 09:34:32,359 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 490 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-11-19 09:34:32,361 INFO  L231             Difference]: Finished difference. Result has 70 places, 56 transitions, 252 flow
[2024-11-19 09:34:32,361 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=70, PETRI_TRANSITIONS=56}
[2024-11-19 09:34:32,362 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -29 predicate places.
[2024-11-19 09:34:32,362 INFO  L471      AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 252 flow
[2024-11-19 09:34:32,362 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:32,362 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:32,363 INFO  L204   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, 1, 1, 1]
[2024-11-19 09:34:32,369 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 (7)] Ended with exit code 0
[2024-11-19 09:34:32,563 WARN  L453      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
[2024-11-19 09:34:32,563 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:32,564 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:32,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -811656883, now seen corresponding path program 1 times
[2024-11-19 09:34:32,565 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:32,565 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354088070]
[2024-11-19 09:34:32,565 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:32,565 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
[2024-11-19 09:34:32,566 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:32,567 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)
[2024-11-19 09:34:32,569 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
[2024-11-19 09:34:32,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:32,752 INFO  L255         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:32,754 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:32,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:32,933 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:32,933 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:32,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354088070]
[2024-11-19 09:34:32,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354088070] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:32,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:32,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 09:34:32,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793517422]
[2024-11-19 09:34:32,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:32,934 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:34:32,934 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:32,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:34:32,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:34:32,939 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:32,939 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 252 flow. Second operand  has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:32,939 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:32,939 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:32,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:33,221 INFO  L124   PetriNetUnfolderBase]: 1227/2217 cut-off events.
[2024-11-19 09:34:33,221 INFO  L125   PetriNetUnfolderBase]: For 1227/1279 co-relation queries the response was YES.
[2024-11-19 09:34:33,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5100 conditions, 2217 events. 1227/2217 cut-off events. For 1227/1279 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13294 event pairs, 495 based on Foata normal form. 0/2076 useless extension candidates. Maximal degree in co-relation 5086. Up to 1326 conditions per place. 
[2024-11-19 09:34:33,241 INFO  L140   encePairwiseOnDemand]: 89/92 looper letters, 37 selfloop transitions, 2 changer transitions 0/69 dead transitions.
[2024-11-19 09:34:33,242 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 362 flow
[2024-11-19 09:34:33,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 09:34:33,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-19 09:34:33,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions.
[2024-11-19 09:34:33,243 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.34782608695652173
[2024-11-19 09:34:33,244 INFO  L175             Difference]: Start difference. First operand has 70 places, 56 transitions, 252 flow. Second operand 4 states and 128 transitions.
[2024-11-19 09:34:33,244 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 362 flow
[2024-11-19 09:34:33,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 69 transitions, 266 flow, removed 17 selfloop flow, removed 10 redundant places.
[2024-11-19 09:34:33,251 INFO  L231             Difference]: Finished difference. Result has 62 places, 55 transitions, 158 flow
[2024-11-19 09:34:33,252 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=55}
[2024-11-19 09:34:33,252 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -37 predicate places.
[2024-11-19 09:34:33,252 INFO  L471      AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 158 flow
[2024-11-19 09:34:33,253 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:33,253 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:33,253 INFO  L204   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, 1, 1, 1]
[2024-11-19 09:34:33,260 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 (8)] Ended with exit code 0
[2024-11-19 09:34:33,453 WARN  L453      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
[2024-11-19 09:34:33,454 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:33,454 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:33,454 INFO  L85        PathProgramCache]: Analyzing trace with hash 1822101420, now seen corresponding path program 1 times
[2024-11-19 09:34:33,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:33,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690666431]
[2024-11-19 09:34:33,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:33,455 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
[2024-11-19 09:34:33,455 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:33,458 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)
[2024-11-19 09:34:33,459 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
[2024-11-19 09:34:33,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:33,627 INFO  L255         TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:33,630 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:33,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:33,915 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:33,915 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:33,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690666431]
[2024-11-19 09:34:33,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690666431] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:33,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:33,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-19 09:34:33,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122528850]
[2024-11-19 09:34:33,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:33,917 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-19 09:34:33,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:33,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-19 09:34:33,918 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-19 09:34:33,918 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:33,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 158 flow. Second operand  has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:33,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:33,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:33,919 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:34,144 INFO  L124   PetriNetUnfolderBase]: 1195/2169 cut-off events.
[2024-11-19 09:34:34,144 INFO  L125   PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES.
[2024-11-19 09:34:34,149 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 2169 events. 1195/2169 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13045 event pairs, 463 based on Foata normal form. 0/2044 useless extension candidates. Maximal degree in co-relation 4238. Up to 1278 conditions per place. 
[2024-11-19 09:34:34,155 INFO  L140   encePairwiseOnDemand]: 89/92 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions.
[2024-11-19 09:34:34,155 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 266 flow
[2024-11-19 09:34:34,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-19 09:34:34,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-19 09:34:34,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions.
[2024-11-19 09:34:34,157 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3451086956521739
[2024-11-19 09:34:34,157 INFO  L175             Difference]: Start difference. First operand has 62 places, 55 transitions, 158 flow. Second operand 4 states and 127 transitions.
[2024-11-19 09:34:34,157 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 266 flow
[2024-11-19 09:34:34,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 68 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-19 09:34:34,163 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 157 flow
[2024-11-19 09:34:34,164 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2024-11-19 09:34:34,165 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -37 predicate places.
[2024-11-19 09:34:34,166 INFO  L471      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 157 flow
[2024-11-19 09:34:34,166 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:34,166 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:34,166 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:34,177 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2024-11-19 09:34:34,367 WARN  L453      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
[2024-11-19 09:34:34,368 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:34,368 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:34,368 INFO  L85        PathProgramCache]: Analyzing trace with hash -420669516, now seen corresponding path program 1 times
[2024-11-19 09:34:34,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:34,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396264485]
[2024-11-19 09:34:34,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:34,369 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
[2024-11-19 09:34:34,370 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:34,373 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)
[2024-11-19 09:34:34,377 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
[2024-11-19 09:34:34,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:34,584 INFO  L255         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:34,586 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:34,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:34,625 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:34,625 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:34,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396264485]
[2024-11-19 09:34:34,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396264485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:34,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:34,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-19 09:34:34,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361009697]
[2024-11-19 09:34:34,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:34,626 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-19 09:34:34,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:34,626 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-19 09:34:34,626 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-19 09:34:34,634 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 21 out of 92
[2024-11-19 09:34:34,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 157 flow. Second operand  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:34,635 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:34,635 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 92
[2024-11-19 09:34:34,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:34,810 INFO  L124   PetriNetUnfolderBase]: 1103/1885 cut-off events.
[2024-11-19 09:34:34,810 INFO  L125   PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES.
[2024-11-19 09:34:34,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 1885 events. 1103/1885 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 10789 event pairs, 958 based on Foata normal form. 16/1804 useless extension candidates. Maximal degree in co-relation 3980. Up to 1459 conditions per place. 
[2024-11-19 09:34:34,824 INFO  L140   encePairwiseOnDemand]: 90/92 looper letters, 22 selfloop transitions, 1 changer transitions 1/53 dead transitions.
[2024-11-19 09:34:34,824 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 203 flow
[2024-11-19 09:34:34,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-19 09:34:34,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-19 09:34:34,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions.
[2024-11-19 09:34:34,826 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3188405797101449
[2024-11-19 09:34:34,826 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 157 flow. Second operand 3 states and 88 transitions.
[2024-11-19 09:34:34,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 203 flow
[2024-11-19 09:34:34,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-19 09:34:34,828 INFO  L231             Difference]: Finished difference. Result has 61 places, 52 transitions, 152 flow
[2024-11-19 09:34:34,828 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=52}
[2024-11-19 09:34:34,828 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -38 predicate places.
[2024-11-19 09:34:34,829 INFO  L471      AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 152 flow
[2024-11-19 09:34:34,829 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:34,829 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:34,829 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:34,836 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 (10)] Ended with exit code 0
[2024-11-19 09:34:35,030 WARN  L453      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
[2024-11-19 09:34:35,030 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:35,030 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:35,030 INFO  L85        PathProgramCache]: Analyzing trace with hash 1053193094, now seen corresponding path program 1 times
[2024-11-19 09:34:35,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:35,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230492048]
[2024-11-19 09:34:35,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-19 09:34:35,031 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
[2024-11-19 09:34:35,031 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:35,033 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)
[2024-11-19 09:34:35,034 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
[2024-11-19 09:34:35,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-19 09:34:35,213 INFO  L255         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:35,216 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:35,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:35,277 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:35,277 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:35,277 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230492048]
[2024-11-19 09:34:35,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [230492048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:35,278 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:35,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-19 09:34:35,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658671100]
[2024-11-19 09:34:35,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:35,278 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-19 09:34:35,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:35,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 09:34:35,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-19 09:34:35,287 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 92
[2024-11-19 09:34:35,287 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 152 flow. Second operand  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:35,288 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:35,288 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 92
[2024-11-19 09:34:35,288 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:35,896 INFO  L124   PetriNetUnfolderBase]: 2814/4699 cut-off events.
[2024-11-19 09:34:35,896 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-19 09:34:35,909 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9914 conditions, 4699 events. 2814/4699 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 30477 event pairs, 489 based on Foata normal form. 16/4505 useless extension candidates. Maximal degree in co-relation 9905. Up to 1648 conditions per place. 
[2024-11-19 09:34:35,918 INFO  L140   encePairwiseOnDemand]: 86/92 looper letters, 42 selfloop transitions, 3 changer transitions 18/90 dead transitions.
[2024-11-19 09:34:35,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 364 flow
[2024-11-19 09:34:35,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:35,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:35,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions.
[2024-11-19 09:34:35,919 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3333333333333333
[2024-11-19 09:34:35,919 INFO  L175             Difference]: Start difference. First operand has 61 places, 52 transitions, 152 flow. Second operand 6 states and 184 transitions.
[2024-11-19 09:34:35,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 364 flow
[2024-11-19 09:34:35,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-19 09:34:35,921 INFO  L231             Difference]: Finished difference. Result has 67 places, 53 transitions, 169 flow
[2024-11-19 09:34:35,922 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=67, PETRI_TRANSITIONS=53}
[2024-11-19 09:34:35,922 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -32 predicate places.
[2024-11-19 09:34:35,922 INFO  L471      AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 169 flow
[2024-11-19 09:34:35,923 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:35,923 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:35,923 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:35,928 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2024-11-19 09:34:36,123 WARN  L453      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
[2024-11-19 09:34:36,124 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:36,124 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:36,124 INFO  L85        PathProgramCache]: Analyzing trace with hash -246023340, now seen corresponding path program 2 times
[2024-11-19 09:34:36,125 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:36,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378230563]
[2024-11-19 09:34:36,125 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-19 09:34:36,125 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
[2024-11-19 09:34:36,125 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:36,126 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)
[2024-11-19 09:34:36,127 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-11-19 09:34:36,312 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-19 09:34:36,312 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:34:36,319 INFO  L255         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:36,324 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:36,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:36,387 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:36,387 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:36,388 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378230563]
[2024-11-19 09:34:36,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378230563] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:36,388 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:36,388 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-19 09:34:36,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899858387]
[2024-11-19 09:34:36,388 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:36,389 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-19 09:34:36,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:36,389 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-19 09:34:36,389 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-19 09:34:36,402 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 92
[2024-11-19 09:34:36,403 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 169 flow. Second operand  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:36,403 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:36,403 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 92
[2024-11-19 09:34:36,403 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:37,188 INFO  L124   PetriNetUnfolderBase]: 4857/8187 cut-off events.
[2024-11-19 09:34:37,188 INFO  L125   PetriNetUnfolderBase]: For 708/708 co-relation queries the response was YES.
[2024-11-19 09:34:37,220 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17058 conditions, 8187 events. 4857/8187 cut-off events. For 708/708 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 59380 event pairs, 1215 based on Foata normal form. 16/7706 useless extension candidates. Maximal degree in co-relation 17045. Up to 3383 conditions per place. 
[2024-11-19 09:34:37,231 INFO  L140   encePairwiseOnDemand]: 87/92 looper letters, 34 selfloop transitions, 1 changer transitions 29/92 dead transitions.
[2024-11-19 09:34:37,231 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 389 flow
[2024-11-19 09:34:37,232 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:37,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:37,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions.
[2024-11-19 09:34:37,233 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3351449275362319
[2024-11-19 09:34:37,233 INFO  L175             Difference]: Start difference. First operand has 67 places, 53 transitions, 169 flow. Second operand 6 states and 185 transitions.
[2024-11-19 09:34:37,233 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 389 flow
[2024-11-19 09:34:37,235 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 379 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:37,236 INFO  L231             Difference]: Finished difference. Result has 70 places, 53 transitions, 172 flow
[2024-11-19 09:34:37,236 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=70, PETRI_TRANSITIONS=53}
[2024-11-19 09:34:37,236 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -29 predicate places.
[2024-11-19 09:34:37,237 INFO  L471      AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 172 flow
[2024-11-19 09:34:37,237 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:37,237 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:37,237 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:37,242 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
[2024-11-19 09:34:37,438 WARN  L453      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
[2024-11-19 09:34:37,438 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:37,438 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:37,438 INFO  L85        PathProgramCache]: Analyzing trace with hash 389525714, now seen corresponding path program 3 times
[2024-11-19 09:34:37,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:37,439 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665857030]
[2024-11-19 09:34:37,439 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-19 09:34:37,439 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
[2024-11-19 09:34:37,439 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:37,443 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)
[2024-11-19 09:34:37,444 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
[2024-11-19 09:34:37,603 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-19 09:34:37,603 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:34:37,608 INFO  L255         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:37,612 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:37,868 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-19 09:34:37,931 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2024-11-19 09:34:38,083 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2024-11-19 09:34:38,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:38,147 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:38,147 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:38,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665857030]
[2024-11-19 09:34:38,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665857030] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:38,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:38,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-19 09:34:38,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403161438]
[2024-11-19 09:34:38,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:38,148 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-19 09:34:38,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:38,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-19 09:34:38,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-19 09:34:38,174 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:38,174 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 172 flow. Second operand  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:38,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:38,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:38,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:39,251 INFO  L124   PetriNetUnfolderBase]: 3560/5980 cut-off events.
[2024-11-19 09:34:39,251 INFO  L125   PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES.
[2024-11-19 09:34:39,270 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12759 conditions, 5980 events. 3560/5980 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 42620 event pairs, 1190 based on Foata normal form. 16/5424 useless extension candidates. Maximal degree in co-relation 12745. Up to 2773 conditions per place. 
[2024-11-19 09:34:39,280 INFO  L140   encePairwiseOnDemand]: 84/92 looper letters, 29 selfloop transitions, 5 changer transitions 12/76 dead transitions.
[2024-11-19 09:34:39,280 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 320 flow
[2024-11-19 09:34:39,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-19 09:34:39,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-19 09:34:39,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions.
[2024-11-19 09:34:39,282 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.3242753623188406
[2024-11-19 09:34:39,282 INFO  L175             Difference]: Start difference. First operand has 70 places, 53 transitions, 172 flow. Second operand 6 states and 179 transitions.
[2024-11-19 09:34:39,282 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 320 flow
[2024-11-19 09:34:39,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 76 transitions, 309 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:39,285 INFO  L231             Difference]: Finished difference. Result has 71 places, 56 transitions, 199 flow
[2024-11-19 09:34:39,285 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=71, PETRI_TRANSITIONS=56}
[2024-11-19 09:34:39,286 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -28 predicate places.
[2024-11-19 09:34:39,286 INFO  L471      AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 199 flow
[2024-11-19 09:34:39,286 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 7 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:39,286 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:39,286 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:39,292 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 (13)] Ended with exit code 0
[2024-11-19 09:34:39,487 WARN  L453      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
[2024-11-19 09:34:39,487 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:39,488 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:39,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 471185244, now seen corresponding path program 4 times
[2024-11-19 09:34:39,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:39,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581172579]
[2024-11-19 09:34:39,488 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-19 09:34:39,488 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
[2024-11-19 09:34:39,489 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:39,490 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-19 09:34:39,491 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2024-11-19 09:34:39,666 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-19 09:34:39,666 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-19 09:34:39,672 INFO  L255         TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 32 conjuncts are in the unsatisfiable core
[2024-11-19 09:34:39,677 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-19 09:34:40,444 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-19 09:34:40,568 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2024-11-19 09:34:40,691 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2024-11-19 09:34:41,291 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3
[2024-11-19 09:34:41,661 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106
[2024-11-19 09:34:41,675 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2024-11-19 09:34:41,688 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2024-11-19 09:34:41,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-19 09:34:41,837 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-19 09:34:41,838 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-19 09:34:41,838 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581172579]
[2024-11-19 09:34:41,838 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581172579] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-19 09:34:41,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-19 09:34:41,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-19 09:34:41,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986939749]
[2024-11-19 09:34:41,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-19 09:34:41,839 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-19 09:34:41,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-19 09:34:41,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-19 09:34:41,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-11-19 09:34:41,910 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 22 out of 92
[2024-11-19 09:34:41,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 199 flow. Second operand  has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:41,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-19 09:34:41,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 92
[2024-11-19 09:34:41,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-19 09:34:43,580 INFO  L124   PetriNetUnfolderBase]: 4524/7634 cut-off events.
[2024-11-19 09:34:43,581 INFO  L125   PetriNetUnfolderBase]: For 1108/1123 co-relation queries the response was YES.
[2024-11-19 09:34:43,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17688 conditions, 7634 events. 4524/7634 cut-off events. For 1108/1123 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 56943 event pairs, 1394 based on Foata normal form. 26/6989 useless extension candidates. Maximal degree in co-relation 17673. Up to 2974 conditions per place. 
[2024-11-19 09:34:43,666 INFO  L140   encePairwiseOnDemand]: 84/92 looper letters, 30 selfloop transitions, 5 changer transitions 16/81 dead transitions.
[2024-11-19 09:34:43,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 81 transitions, 363 flow
[2024-11-19 09:34:43,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-19 09:34:43,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-19 09:34:43,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 205 transitions.
[2024-11-19 09:34:43,669 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.31832298136645965
[2024-11-19 09:34:43,669 INFO  L175             Difference]: Start difference. First operand has 71 places, 56 transitions, 199 flow. Second operand 7 states and 205 transitions.
[2024-11-19 09:34:43,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 81 transitions, 363 flow
[2024-11-19 09:34:43,672 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 351 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-11-19 09:34:43,673 INFO  L231             Difference]: Finished difference. Result has 75 places, 57 transitions, 219 flow
[2024-11-19 09:34:43,673 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=75, PETRI_TRANSITIONS=57}
[2024-11-19 09:34:43,674 INFO  L277   CegarLoopForPetriNet]: 99 programPoint places, -24 predicate places.
[2024-11-19 09:34:43,674 INFO  L471      AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 219 flow
[2024-11-19 09:34:43,675 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-19 09:34:43,675 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-19 09:34:43,675 INFO  L204   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, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:43,682 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 (14)] Ended with exit code 0
[2024-11-19 09:34:43,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-19 09:34:43,876 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] ===
[2024-11-19 09:34:43,876 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-19 09:34:43,876 INFO  L85        PathProgramCache]: Analyzing trace with hash -18579930, now seen corresponding path program 5 times
[2024-11-19 09:34:43,877 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-19 09:34:43,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899984510]
[2024-11-19 09:34:43,877 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-11-19 09:34:43,877 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
[2024-11-19 09:34:43,877 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-19 09:34:43,879 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-19 09:34:43,880 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process
[2024-11-19 09:34:44,061 INFO  L227   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-19 09:34:44,061 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-19 09:34:44,061 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-19 09:34:44,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-19 09:34:44,248 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-11-19 09:34:44,248 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-19 09:34:44,249 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (71 of 72 remaining)
[2024-11-19 09:34:44,251 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 72 remaining)
[2024-11-19 09:34:44,252 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 72 remaining)
[2024-11-19 09:34:44,252 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 72 remaining)
[2024-11-19 09:34:44,252 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 72 remaining)
[2024-11-19 09:34:44,252 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 72 remaining)
[2024-11-19 09:34:44,252 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 72 remaining)
[2024-11-19 09:34:44,252 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 72 remaining)
[2024-11-19 09:34:44,253 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 72 remaining)
[2024-11-19 09:34:44,253 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 72 remaining)
[2024-11-19 09:34:44,253 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 72 remaining)
[2024-11-19 09:34:44,253 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 72 remaining)
[2024-11-19 09:34:44,253 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 72 remaining)
[2024-11-19 09:34:44,254 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 72 remaining)
[2024-11-19 09:34:44,254 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 72 remaining)
[2024-11-19 09:34:44,254 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 72 remaining)
[2024-11-19 09:34:44,254 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 72 remaining)
[2024-11-19 09:34:44,254 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 72 remaining)
[2024-11-19 09:34:44,254 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 72 remaining)
[2024-11-19 09:34:44,255 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 72 remaining)
[2024-11-19 09:34:44,255 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 72 remaining)
[2024-11-19 09:34:44,255 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 72 remaining)
[2024-11-19 09:34:44,257 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 72 remaining)
[2024-11-19 09:34:44,257 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 72 remaining)
[2024-11-19 09:34:44,257 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 72 remaining)
[2024-11-19 09:34:44,257 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 72 remaining)
[2024-11-19 09:34:44,258 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 72 remaining)
[2024-11-19 09:34:44,258 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 72 remaining)
[2024-11-19 09:34:44,258 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 72 remaining)
[2024-11-19 09:34:44,258 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 72 remaining)
[2024-11-19 09:34:44,258 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 72 remaining)
[2024-11-19 09:34:44,259 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 72 remaining)
[2024-11-19 09:34:44,259 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 72 remaining)
[2024-11-19 09:34:44,259 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 72 remaining)
[2024-11-19 09:34:44,259 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 72 remaining)
[2024-11-19 09:34:44,260 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 72 remaining)
[2024-11-19 09:34:44,260 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 72 remaining)
[2024-11-19 09:34:44,260 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 72 remaining)
[2024-11-19 09:34:44,260 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 72 remaining)
[2024-11-19 09:34:44,260 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 72 remaining)
[2024-11-19 09:34:44,260 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 72 remaining)
[2024-11-19 09:34:44,261 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 72 remaining)
[2024-11-19 09:34:44,261 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 72 remaining)
[2024-11-19 09:34:44,261 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (28 of 72 remaining)
[2024-11-19 09:34:44,261 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 72 remaining)
[2024-11-19 09:34:44,261 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 72 remaining)
[2024-11-19 09:34:44,262 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 72 remaining)
[2024-11-19 09:34:44,262 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 72 remaining)
[2024-11-19 09:34:44,262 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 72 remaining)
[2024-11-19 09:34:44,262 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 72 remaining)
[2024-11-19 09:34:44,262 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 72 remaining)
[2024-11-19 09:34:44,263 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 72 remaining)
[2024-11-19 09:34:44,263 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 72 remaining)
[2024-11-19 09:34:44,263 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 72 remaining)
[2024-11-19 09:34:44,263 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 72 remaining)
[2024-11-19 09:34:44,263 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 72 remaining)
[2024-11-19 09:34:44,264 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 72 remaining)
[2024-11-19 09:34:44,264 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 72 remaining)
[2024-11-19 09:34:44,264 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 72 remaining)
[2024-11-19 09:34:44,264 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 72 remaining)
[2024-11-19 09:34:44,265 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 72 remaining)
[2024-11-19 09:34:44,265 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 72 remaining)
[2024-11-19 09:34:44,265 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 72 remaining)
[2024-11-19 09:34:44,265 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 72 remaining)
[2024-11-19 09:34:44,265 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 72 remaining)
[2024-11-19 09:34:44,265 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 72 remaining)
[2024-11-19 09:34:44,266 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 72 remaining)
[2024-11-19 09:34:44,266 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 72 remaining)
[2024-11-19 09:34:44,266 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 72 remaining)
[2024-11-19 09:34:44,266 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 72 remaining)
[2024-11-19 09:34:44,266 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 72 remaining)
[2024-11-19 09:34:44,266 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 72 remaining)
[2024-11-19 09:34:44,274 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 (15)] Ended with exit code 0
[2024-11-19 09:34:44,467 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-19 09:34:44,467 INFO  L407         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-19 09:34:44,614 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-19 09:34:44,614 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-19 09:34:44,622 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:34:44 BasicIcfg
[2024-11-19 09:34:44,622 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-19 09:34:44,630 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-19 09:34:44,630 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-19 09:34:44,631 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-19 09:34:44,631 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:34:18" (3/4) ...
[2024-11-19 09:34:44,633 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-19 09:34:44,635 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-19 09:34:44,636 INFO  L158              Benchmark]: Toolchain (without parser) took 28803.79ms. Allocated memory was 56.6MB in the beginning and 5.3GB in the end (delta: 5.3GB). Free memory was 37.0MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
[2024-11-19 09:34:44,637 INFO  L158              Benchmark]: CDTParser took 1.14ms. Allocated memory is still 44.0MB. Free memory is still 28.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 09:34:44,637 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 694.29ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 111.0kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2024-11-19 09:34:44,639 INFO  L158              Benchmark]: Boogie Procedure Inliner took 73.47ms. Allocated memory is still 69.2MB. Free memory was 36.4MB in the beginning and 33.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-19 09:34:44,640 INFO  L158              Benchmark]: Boogie Preprocessor took 107.08ms. Allocated memory is still 69.2MB. Free memory was 33.7MB in the beginning and 46.9MB in the end (delta: -13.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB.
[2024-11-19 09:34:44,640 INFO  L158              Benchmark]: RCFGBuilder took 1689.07ms. Allocated memory was 69.2MB in the beginning and 111.1MB in the end (delta: 41.9MB). Free memory was 46.9MB in the beginning and 61.7MB in the end (delta: -14.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB.
[2024-11-19 09:34:44,640 INFO  L158              Benchmark]: TraceAbstraction took 26220.95ms. Allocated memory was 111.1MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 60.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
[2024-11-19 09:34:44,642 INFO  L158              Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 5.3GB. Free memory is still 3.5GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-19 09:34:44,644 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 1.14ms. Allocated memory is still 44.0MB. Free memory is still 28.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 694.29ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 36.8MB in the beginning and 36.7MB in the end (delta: 111.0kB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 73.47ms. Allocated memory is still 69.2MB. Free memory was 36.4MB in the beginning and 33.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 107.08ms. Allocated memory is still 69.2MB. Free memory was 33.7MB in the beginning and 46.9MB in the end (delta: -13.2MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1689.07ms. Allocated memory was 69.2MB in the beginning and 111.1MB in the end (delta: 41.9MB). Free memory was 46.9MB in the beginning and 61.7MB in the end (delta: -14.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB.
 * TraceAbstraction took 26220.95ms. Allocated memory was 111.1MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 60.4MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB.
 * Witness Printer took 4.88ms. Allocated memory is still 5.3GB. Free memory is still 3.5GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 18. 
Possible FailurePath: 
[L711]               0  int __unbuffered_cnt = 0;
[L713]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  _Bool __unbuffered_p0_EAX$flush_delayed;
[L715]               0  int __unbuffered_p0_EAX$mem_tmp;
[L716]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L717]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L718]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L719]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L720]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd4;
[L721]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L722]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L723]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L724]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L725]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd4;
[L726]               0  _Bool __unbuffered_p0_EAX$read_delayed;
[L727]               0  int *__unbuffered_p0_EAX$read_delayed_var;
[L728]               0  int __unbuffered_p0_EAX$w_buff0;
[L729]               0  _Bool __unbuffered_p0_EAX$w_buff0_used;
[L730]               0  int __unbuffered_p0_EAX$w_buff1;
[L731]               0  _Bool __unbuffered_p0_EAX$w_buff1_used;
[L733]               0  int __unbuffered_p0_EBX = 0;
[L735]               0  int __unbuffered_p2_EAX = 0;
[L736]               0  _Bool main$tmp_guard0;
[L737]               0  _Bool main$tmp_guard1;
[L739]               0  int x = 0;
[L741]               0  int y = 0;
[L741]               0  int y = 0;
[L742]               0  _Bool y$flush_delayed;
[L743]               0  int y$mem_tmp;
[L744]               0  _Bool y$r_buff0_thd0;
[L745]               0  _Bool y$r_buff0_thd1;
[L746]               0  _Bool y$r_buff0_thd2;
[L747]               0  _Bool y$r_buff0_thd3;
[L748]               0  _Bool y$r_buff0_thd4;
[L749]               0  _Bool y$r_buff1_thd0;
[L750]               0  _Bool y$r_buff1_thd1;
[L751]               0  _Bool y$r_buff1_thd2;
[L752]               0  _Bool y$r_buff1_thd3;
[L753]               0  _Bool y$r_buff1_thd4;
[L754]               0  _Bool y$read_delayed;
[L755]               0  int *y$read_delayed_var;
[L756]               0  int y$w_buff0;
[L757]               0  _Bool y$w_buff0_used;
[L758]               0  int y$w_buff1;
[L759]               0  _Bool y$w_buff1_used;
[L760]               0  _Bool weak$$choice0;
[L761]               0  _Bool weak$$choice1;
[L762]               0  _Bool weak$$choice2;
[L853]               0  pthread_t t2241;
[L854]  FCALL, FORK  0  pthread_create(&t2241, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2241=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L766]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L767]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L768]               1  y$flush_delayed = weak$$choice2
[L769]  EXPR         1  \read(y)
[L769]               1  y$mem_tmp = y
[L770]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L770]  EXPR         1  \read(y)
[L770]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L770]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L771]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L772]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L773]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L774]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L775]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L776]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L777]               1  __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L778]               1  __unbuffered_p0_EAX$read_delayed_var = &y
[L779]  EXPR         1  \read(y)
[L779]               1  __unbuffered_p0_EAX = y
[L780]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L780]  EXPR         1  \read(y)
[L780]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L780]               1  y = y$flush_delayed ? y$mem_tmp : y
[L781]               1  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L855]               0  pthread_t t2242;
[L856]  FCALL, FORK  0  pthread_create(&t2242, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241=0, t2242=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L857]               0  pthread_t t2243;
[L858]  FCALL, FORK  0  pthread_create(&t2243, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241=0, t2242=1, t2243=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L784]               1  __unbuffered_p0_EBX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L796]               2  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L808]               3  __unbuffered_p2_EAX = x
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L859]               0  pthread_t t2244;
[L860]  FCALL, FORK  0  pthread_create(&t2244, ((void *)0), P3, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241=0, t2242=1, t2243=2, t2244=3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L811]               3  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L814]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L814]  EXPR         3  \read(y)
[L814]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L814]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L815]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L816]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L817]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L818]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L828]               4  y = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L831]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L831]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L831]  EXPR         4  \read(y)
[L831]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L831]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L831]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L832]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L833]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L834]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L835]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L789]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L801]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L838]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L821]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L862]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241=0, t2242=1, t2243=2, t2244=3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L864]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
[L864]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L866]  EXPR         0  \read(y)
[L866]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L867]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L868]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L869]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L870]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241=0, t2242=1, t2243=2, t2244=3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L873]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L874]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L875]               0  y$flush_delayed = weak$$choice2
[L876]  EXPR         0  \read(y)
[L876]               0  y$mem_tmp = y
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  \read(y)
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L878]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L879]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L880]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L881]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L883]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L884]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L885]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L885]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L885]  EXPR         0  \read(*__unbuffered_p0_EAX$read_delayed_var)
[L885]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L885]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L885]               0  __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L886]  EXPR         0  \read(y)
[L886]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
[L887]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L887]  EXPR         0  \read(y)
[L887]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L887]               0  y = y$flush_delayed ? y$mem_tmp : y
[L888]               0  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241=0, t2242=1, t2243=2, t2244=3, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L890]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
[L19]   CALL         0  reach_error()
[L18]   COND FALSE   0  !(0)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L18]                0  __assert_fail ("0", "safe019_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]

  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 145 locations, 72 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: 25.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 706 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 674 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1865 IncrementalHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 3 mSDtfsCounter, 1865 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=6, InterpolantAutomatonStates: 64, 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.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 2816 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2365 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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
[2024-11-19 09:34:44,683 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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