./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 839c364b
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 09aaf4da9760e082dee1b84490861799ac10c7d3871bbdf2d8243e88d9e00b49
--- Real Ultimate output ---
This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364
[2021-12-14 16:37:36,381 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-12-14 16:37:36,383 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-14 16:37:36,416 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-14 16:37:36,417 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-14 16:37:36,418 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-14 16:37:36,419 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-14 16:37:36,420 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-14 16:37:36,422 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-14 16:37:36,423 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-14 16:37:36,423 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-12-14 16:37:36,424 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-14 16:37:36,425 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-14 16:37:36,426 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-14 16:37:36,427 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-14 16:37:36,428 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-14 16:37:36,429 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-14 16:37:36,430 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-14 16:37:36,431 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-14 16:37:36,433 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-14 16:37:36,434 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-14 16:37:36,436 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-14 16:37:36,437 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-12-14 16:37:36,438 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-14 16:37:36,440 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-14 16:37:36,440 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-14 16:37:36,440 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-14 16:37:36,441 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-14 16:37:36,441 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-14 16:37:36,442 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-14 16:37:36,442 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-14 16:37:36,443 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-14 16:37:36,444 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-14 16:37:36,444 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-14 16:37:36,445 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-14 16:37:36,445 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-14 16:37:36,446 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-14 16:37:36,446 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-14 16:37:36,446 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-14 16:37:36,447 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-14 16:37:36,448 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-12-14 16:37:36,456 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-12-14 16:37:36,489 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-12-14 16:37:36,490 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-14 16:37:36,490 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-14 16:37:36,491 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-14 16:37:36,491 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-14 16:37:36,492 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-14 16:37:36,492 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-14 16:37:36,492 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-12-14 16:37:36,493 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-12-14 16:37:36,493 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-14 16:37:36,494 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-12-14 16:37:36,494 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-12-14 16:37:36,494 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-12-14 16:37:36,494 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-12-14 16:37:36,495 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-12-14 16:37:36,495 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-14 16:37:36,495 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-12-14 16:37:36,495 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-12-14 16:37:36,495 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-12-14 16:37:36,495 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-12-14 16:37:36,496 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-12-14 16:37:36,496 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-14 16:37:36,496 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-12-14 16:37:36,496 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-12-14 16:37:36,496 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-14 16:37:36,497 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-14 16:37:36,497 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-12-14 16:37:36,498 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-12-14 16:37:36,499 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-12-14 16:37:36,499 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-12-14 16:37:36,499 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-12-14 16:37:36,499 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-12-14 16:37:36,499 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-12-14 16:37:36,500 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-12-14 16:37:36,500 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


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 -> 09aaf4da9760e082dee1b84490861799ac10c7d3871bbdf2d8243e88d9e00b49
[2021-12-14 16:37:36,739 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-14 16:37:36,763 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-14 16:37:36,765 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-14 16:37:36,766 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-12-14 16:37:36,767 INFO  L275        PluginConnector]: CDTParser initialized
[2021-12-14 16:37:36,768 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i
[2021-12-14 16:37:36,830 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3f15d9f/6f20500c6c93430c8445f6b24d606c98/FLAGf01bdd835
[2021-12-14 16:37:37,264 INFO  L306              CDTParser]: Found 1 translation units.
[2021-12-14 16:37:37,265 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i
[2021-12-14 16:37:37,281 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3f15d9f/6f20500c6c93430c8445f6b24d606c98/FLAGf01bdd835
[2021-12-14 16:37:37,293 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3f15d9f/6f20500c6c93430c8445f6b24d606c98
[2021-12-14 16:37:37,296 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-14 16:37:37,298 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-14 16:37:37,299 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-14 16:37:37,299 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-14 16:37:37,302 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-14 16:37:37,303 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,304 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff667f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37, skipping insertion in model container
[2021-12-14 16:37:37,304 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,310 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-12-14 16:37:37,350 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-12-14 16:37:37,507 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i[992,1005]
[2021-12-14 16:37:37,743 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-14 16:37:37,750 INFO  L203         MainTranslator]: Completed pre-run
[2021-12-14 16:37:37,760 WARN  L230   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe014_rmo.opt.i[992,1005]
[2021-12-14 16:37:37,805 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-14 16:37:37,832 INFO  L208         MainTranslator]: Completed translation
[2021-12-14 16:37:37,832 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37 WrapperNode
[2021-12-14 16:37:37,833 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-14 16:37:37,834 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-14 16:37:37,834 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-14 16:37:37,834 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-14 16:37:37,840 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,862 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,890 INFO  L137                Inliner]: procedures = 176, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 259
[2021-12-14 16:37:37,890 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-14 16:37:37,891 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-14 16:37:37,891 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-14 16:37:37,891 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-12-14 16:37:37,898 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,898 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,904 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,905 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,922 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,927 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,935 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,941 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-14 16:37:37,942 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-14 16:37:37,942 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-12-14 16:37:37,942 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-12-14 16:37:37,944 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (1/1) ...
[2021-12-14 16:37:37,971 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-14 16:37:37,985 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-14 16:37:38,001 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-12-14 16:37:38,024 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-12-14 16:37:38,039 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2021-12-14 16:37:38,039 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-12-14 16:37:38,039 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-12-14 16:37:38,039 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2021-12-14 16:37:38,040 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-14 16:37:38,040 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-14 16:37:38,041 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-12-14 16:37:38,041 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-12-14 16:37:38,041 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-12-14 16:37:38,041 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-12-14 16:37:38,042 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-12-14 16:37:38,042 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-12-14 16:37:38,042 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-12-14 16:37:38,042 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-12-14 16:37:38,042 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-14 16:37:38,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-14 16:37:38,062 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-12-14 16:37:38,266 INFO  L236             CfgBuilder]: Building ICFG
[2021-12-14 16:37:38,267 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-14 16:37:38,907 INFO  L277             CfgBuilder]: Performing block encoding
[2021-12-14 16:37:39,401 INFO  L296             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-14 16:37:39,402 INFO  L301             CfgBuilder]: Removed 0 assume(true) statements.
[2021-12-14 16:37:39,404 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:37:39 BoogieIcfgContainer
[2021-12-14 16:37:39,405 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-14 16:37:39,406 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-12-14 16:37:39,407 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-12-14 16:37:39,410 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-12-14 16:37:39,410 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:37:37" (1/3) ...
[2021-12-14 16:37:39,411 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc8626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:37:39, skipping insertion in model container
[2021-12-14 16:37:39,412 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:37:37" (2/3) ...
[2021-12-14 16:37:39,412 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc8626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:37:39, skipping insertion in model container
[2021-12-14 16:37:39,412 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:37:39" (3/3) ...
[2021-12-14 16:37:39,416 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe014_rmo.opt.i
[2021-12-14 16:37:39,420 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-12-14 16:37:39,420 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-12-14 16:37:39,420 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2021-12-14 16:37:39,420 INFO  L513   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-12-14 16:37:39,474 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,475 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,475 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,475 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,476 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,476 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,476 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,476 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,477 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,477 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,477 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,478 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,478 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,478 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,478 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,478 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,478 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,479 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,479 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,480 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,480 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,480 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,481 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,481 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,481 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,481 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,482 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,482 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,482 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,482 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,482 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,482 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,482 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,483 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,483 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,483 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,483 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,483 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,483 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,484 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,484 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,484 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,484 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,485 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,485 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,485 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,485 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,485 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,485 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,485 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,486 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,486 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,487 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,488 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,488 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,488 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,488 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,488 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,488 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,489 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,489 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,489 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,489 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,489 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,489 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,490 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,490 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,490 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,491 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,491 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,491 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,491 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,491 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,491 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,491 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,492 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,492 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,492 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,493 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,494 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,494 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,494 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,495 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,495 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,496 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,496 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,496 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,496 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,500 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,500 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,500 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,500 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,500 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,501 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,501 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,501 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,503 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,504 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,504 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,504 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,504 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,505 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,505 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,505 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,505 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,505 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,506 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,506 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,506 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,506 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,506 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,506 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,507 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,507 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,507 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,507 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,507 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,508 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,508 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,508 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,508 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,508 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,508 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,508 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,509 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,509 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,509 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,510 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,510 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,510 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,510 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,510 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,510 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,511 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,511 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,511 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,511 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,511 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,511 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,512 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,512 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,512 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,512 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,512 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,512 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,512 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,513 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,513 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,513 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,514 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,514 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,514 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,515 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,515 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,515 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,516 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,516 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,516 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,516 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,516 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,516 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,516 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,517 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,517 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,517 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,517 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,517 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,517 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,517 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,518 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,518 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,518 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,518 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,518 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,518 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,518 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,519 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,519 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,519 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,519 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,519 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,519 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,521 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,521 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,521 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,521 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,522 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,522 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,522 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,522 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,522 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,522 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,522 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,523 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,523 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,523 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,523 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,523 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,523 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,523 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,524 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,524 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,524 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,524 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,524 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,525 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,528 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,528 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,528 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,528 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,529 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,529 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,529 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,529 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,529 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,530 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,531 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,531 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,531 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,531 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,531 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,531 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,532 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,532 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,532 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,532 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,534 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,540 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,540 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,540 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,540 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,540 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,541 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,541 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,541 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,541 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,542 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,542 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,542 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,542 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,542 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,542 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,542 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,543 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,543 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,543 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,544 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,544 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,548 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,548 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,549 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,549 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,549 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,549 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,549 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,550 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,550 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,550 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,550 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,550 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,551 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,551 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,551 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,551 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,551 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,551 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,552 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,552 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,552 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,552 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,552 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,552 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,552 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,553 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,553 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,553 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,553 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,553 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,553 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,554 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,554 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,554 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,554 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,554 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,554 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,555 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,556 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,556 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,556 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,556 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,556 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,557 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,557 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,557 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,557 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,557 WARN  L322   ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,557 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,557 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,558 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,558 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,558 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,558 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,558 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,558 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,559 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,559 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,559 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,559 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,559 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,559 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,559 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,560 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,560 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,560 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,560 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,560 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,560 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,561 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,561 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,561 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,561 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,562 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,562 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,562 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,562 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,562 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,562 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,563 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-14 16:37:39,563 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-12-14 16:37:39,617 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-12-14 16:37:39,630 INFO  L339      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR
[2021-12-14 16:37:39,631 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-12-14 16:37:39,645 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 279 flow
[2021-12-14 16:37:39,699 INFO  L129       PetriNetUnfolder]: 2/129 cut-off events.
[2021-12-14 16:37:39,700 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-14 16:37:39,703 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. 
[2021-12-14 16:37:39,703 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 132 transitions, 279 flow
[2021-12-14 16:37:39,709 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 124 places, 115 transitions, 239 flow
[2021-12-14 16:37:39,759 INFO  L129       PetriNetUnfolder]: 1/114 cut-off events.
[2021-12-14 16:37:39,759 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-14 16:37:39,760 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:39,761 INFO  L254   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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-14 16:37:39,762 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:39,767 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:39,767 INFO  L85        PathProgramCache]: Analyzing trace with hash 1658054542, now seen corresponding path program 1 times
[2021-12-14 16:37:39,775 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:39,775 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954056656]
[2021-12-14 16:37:39,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:39,777 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:40,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:40,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:40,369 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:40,369 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954056656]
[2021-12-14 16:37:40,370 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954056656] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:40,370 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:40,370 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-14 16:37:40,372 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833509325]
[2021-12-14 16:37:40,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:40,380 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-14 16:37:40,381 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:40,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-14 16:37:40,413 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-14 16:37:40,416 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 132
[2021-12-14 16:37:40,423 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 239 flow. Second operand  has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:40,423 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:40,423 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 132
[2021-12-14 16:37:40,424 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:40,982 INFO  L129       PetriNetUnfolder]: 278/706 cut-off events.
[2021-12-14 16:37:40,982 INFO  L130       PetriNetUnfolder]: For 10/10 co-relation queries the response was YES.
[2021-12-14 16:37:40,987 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 706 events. 278/706 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3825 event pairs, 144 based on Foata normal form. 21/701 useless extension candidates. Maximal degree in co-relation 1116. Up to 239 conditions per place. 
[2021-12-14 16:37:40,992 INFO  L132   encePairwiseOnDemand]: 125/132 looper letters, 20 selfloop transitions, 2 changer transitions 31/151 dead transitions.
[2021-12-14 16:37:40,993 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 151 transitions, 423 flow
[2021-12-14 16:37:40,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-14 16:37:40,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-14 16:37:41,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1065 transitions.
[2021-12-14 16:37:41,013 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8964646464646465
[2021-12-14 16:37:41,014 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1065 transitions.
[2021-12-14 16:37:41,014 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1065 transitions.
[2021-12-14 16:37:41,019 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:41,021 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1065 transitions.
[2021-12-14 16:37:41,027 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 118.33333333333333) internal successors, (1065), 9 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,037 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,038 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,039 INFO  L186             Difference]: Start difference. First operand has 124 places, 115 transitions, 239 flow. Second operand 9 states and 1065 transitions.
[2021-12-14 16:37:41,040 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 151 transitions, 423 flow
[2021-12-14 16:37:41,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 151 transitions, 418 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-12-14 16:37:41,048 INFO  L242             Difference]: Finished difference. Result has 136 places, 114 transitions, 254 flow
[2021-12-14 16:37:41,050 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=254, PETRI_PLACES=136, PETRI_TRANSITIONS=114}
[2021-12-14 16:37:41,053 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 12 predicate places.
[2021-12-14 16:37:41,054 INFO  L470      AbstractCegarLoop]: Abstraction has has 136 places, 114 transitions, 254 flow
[2021-12-14 16:37:41,055 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,055 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:41,055 INFO  L254   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, 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, 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]
[2021-12-14 16:37:41,055 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-12-14 16:37:41,056 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:41,056 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:41,056 INFO  L85        PathProgramCache]: Analyzing trace with hash -2026742867, now seen corresponding path program 1 times
[2021-12-14 16:37:41,057 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:41,057 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698205731]
[2021-12-14 16:37:41,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:41,057 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:41,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:41,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:41,335 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:41,335 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698205731]
[2021-12-14 16:37:41,336 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698205731] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:41,336 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:41,336 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-14 16:37:41,336 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260753695]
[2021-12-14 16:37:41,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:41,338 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-14 16:37:41,338 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:41,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-14 16:37:41,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-12-14 16:37:41,341 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 132
[2021-12-14 16:37:41,342 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 114 transitions, 254 flow. Second operand  has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,342 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:41,342 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 132
[2021-12-14 16:37:41,342 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:41,676 INFO  L129       PetriNetUnfolder]: 166/471 cut-off events.
[2021-12-14 16:37:41,677 INFO  L130       PetriNetUnfolder]: For 112/112 co-relation queries the response was YES.
[2021-12-14 16:37:41,679 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 893 conditions, 471 events. 166/471 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2143 event pairs, 30 based on Foata normal form. 12/469 useless extension candidates. Maximal degree in co-relation 819. Up to 141 conditions per place. 
[2021-12-14 16:37:41,681 INFO  L132   encePairwiseOnDemand]: 125/132 looper letters, 16 selfloop transitions, 3 changer transitions 25/142 dead transitions.
[2021-12-14 16:37:41,681 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 142 transitions, 416 flow
[2021-12-14 16:37:41,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-14 16:37:41,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-14 16:37:41,684 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1166 transitions.
[2021-12-14 16:37:41,684 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8833333333333333
[2021-12-14 16:37:41,684 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1166 transitions.
[2021-12-14 16:37:41,685 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1166 transitions.
[2021-12-14 16:37:41,685 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:41,685 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1166 transitions.
[2021-12-14 16:37:41,688 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 116.6) internal successors, (1166), 10 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,690 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,691 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,691 INFO  L186             Difference]: Start difference. First operand has 136 places, 114 transitions, 254 flow. Second operand 10 states and 1166 transitions.
[2021-12-14 16:37:41,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 142 transitions, 416 flow
[2021-12-14 16:37:41,695 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 142 transitions, 384 flow, removed 14 selfloop flow, removed 8 redundant places.
[2021-12-14 16:37:41,697 INFO  L242             Difference]: Finished difference. Result has 138 places, 114 transitions, 260 flow
[2021-12-14 16:37:41,697 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=260, PETRI_PLACES=138, PETRI_TRANSITIONS=114}
[2021-12-14 16:37:41,698 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 14 predicate places.
[2021-12-14 16:37:41,698 INFO  L470      AbstractCegarLoop]: Abstraction has has 138 places, 114 transitions, 260 flow
[2021-12-14 16:37:41,699 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 113.71428571428571) internal successors, (796), 7 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,699 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:41,699 INFO  L254   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, 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, 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]
[2021-12-14 16:37:41,700 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-12-14 16:37:41,700 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:41,700 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:41,700 INFO  L85        PathProgramCache]: Analyzing trace with hash -530984660, now seen corresponding path program 1 times
[2021-12-14 16:37:41,701 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:41,701 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719820679]
[2021-12-14 16:37:41,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:41,701 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:41,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:41,874 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:41,874 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:41,874 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719820679]
[2021-12-14 16:37:41,875 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719820679] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:41,875 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:41,875 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-14 16:37:41,875 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731006561]
[2021-12-14 16:37:41,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:41,876 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-14 16:37:41,876 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:41,877 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-14 16:37:41,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-12-14 16:37:41,878 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 132
[2021-12-14 16:37:41,879 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 114 transitions, 260 flow. Second operand  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:41,879 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:41,879 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 132
[2021-12-14 16:37:41,879 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:42,275 INFO  L129       PetriNetUnfolder]: 234/619 cut-off events.
[2021-12-14 16:37:42,275 INFO  L130       PetriNetUnfolder]: For 158/158 co-relation queries the response was YES.
[2021-12-14 16:37:42,278 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 619 events. 234/619 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3130 event pairs, 58 based on Foata normal form. 12/599 useless extension candidates. Maximal degree in co-relation 1154. Up to 141 conditions per place. 
[2021-12-14 16:37:42,282 INFO  L132   encePairwiseOnDemand]: 124/132 looper letters, 19 selfloop transitions, 4 changer transitions 29/148 dead transitions.
[2021-12-14 16:37:42,282 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 148 transitions, 457 flow
[2021-12-14 16:37:42,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-14 16:37:42,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-14 16:37:42,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1154 transitions.
[2021-12-14 16:37:42,285 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8742424242424243
[2021-12-14 16:37:42,285 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1154 transitions.
[2021-12-14 16:37:42,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1154 transitions.
[2021-12-14 16:37:42,286 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:42,286 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1154 transitions.
[2021-12-14 16:37:42,289 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:42,292 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:42,293 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:42,293 INFO  L186             Difference]: Start difference. First operand has 138 places, 114 transitions, 260 flow. Second operand 10 states and 1154 transitions.
[2021-12-14 16:37:42,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 148 transitions, 457 flow
[2021-12-14 16:37:42,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 148 transitions, 423 flow, removed 14 selfloop flow, removed 9 redundant places.
[2021-12-14 16:37:42,303 INFO  L242             Difference]: Finished difference. Result has 140 places, 114 transitions, 272 flow
[2021-12-14 16:37:42,304 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=272, PETRI_PLACES=140, PETRI_TRANSITIONS=114}
[2021-12-14 16:37:42,307 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 16 predicate places.
[2021-12-14 16:37:42,307 INFO  L470      AbstractCegarLoop]: Abstraction has has 140 places, 114 transitions, 272 flow
[2021-12-14 16:37:42,307 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:42,308 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:42,308 INFO  L254   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, 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, 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]
[2021-12-14 16:37:42,308 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-12-14 16:37:42,308 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:42,309 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:42,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 747809035, now seen corresponding path program 1 times
[2021-12-14 16:37:42,309 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:42,310 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148334800]
[2021-12-14 16:37:42,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:42,310 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:42,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:42,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:42,527 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:42,527 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148334800]
[2021-12-14 16:37:42,527 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148334800] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:42,527 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:42,528 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-14 16:37:42,528 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681791984]
[2021-12-14 16:37:42,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:42,528 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-14 16:37:42,529 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:42,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-14 16:37:42,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-14 16:37:42,530 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132
[2021-12-14 16:37:42,531 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 114 transitions, 272 flow. Second operand  has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:42,531 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:42,531 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132
[2021-12-14 16:37:42,532 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:42,990 INFO  L129       PetriNetUnfolder]: 554/1295 cut-off events.
[2021-12-14 16:37:42,990 INFO  L130       PetriNetUnfolder]: For 181/182 co-relation queries the response was YES.
[2021-12-14 16:37:42,994 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1295 events. 554/1295 cut-off events. For 181/182 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7990 event pairs, 27 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 2372. Up to 356 conditions per place. 
[2021-12-14 16:37:42,997 INFO  L132   encePairwiseOnDemand]: 122/132 looper letters, 28 selfloop transitions, 6 changer transitions 45/173 dead transitions.
[2021-12-14 16:37:42,998 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 173 transitions, 557 flow
[2021-12-14 16:37:42,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-14 16:37:42,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-14 16:37:43,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1171 transitions.
[2021-12-14 16:37:43,001 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8871212121212121
[2021-12-14 16:37:43,001 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1171 transitions.
[2021-12-14 16:37:43,001 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1171 transitions.
[2021-12-14 16:37:43,002 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:43,002 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1171 transitions.
[2021-12-14 16:37:43,005 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 117.1) internal successors, (1171), 10 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,007 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,008 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,008 INFO  L186             Difference]: Start difference. First operand has 140 places, 114 transitions, 272 flow. Second operand 10 states and 1171 transitions.
[2021-12-14 16:37:43,008 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 173 transitions, 557 flow
[2021-12-14 16:37:43,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 173 transitions, 520 flow, removed 9 selfloop flow, removed 11 redundant places.
[2021-12-14 16:37:43,013 INFO  L242             Difference]: Finished difference. Result has 138 places, 116 transitions, 296 flow
[2021-12-14 16:37:43,014 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=296, PETRI_PLACES=138, PETRI_TRANSITIONS=116}
[2021-12-14 16:37:43,014 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 14 predicate places.
[2021-12-14 16:37:43,015 INFO  L470      AbstractCegarLoop]: Abstraction has has 138 places, 116 transitions, 296 flow
[2021-12-14 16:37:43,015 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,015 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:43,016 INFO  L254   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, 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, 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]
[2021-12-14 16:37:43,016 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-12-14 16:37:43,016 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:43,016 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:43,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 1519809872, now seen corresponding path program 1 times
[2021-12-14 16:37:43,017 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:43,017 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846958148]
[2021-12-14 16:37:43,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:43,017 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:43,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:43,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:43,185 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:43,185 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846958148]
[2021-12-14 16:37:43,186 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846958148] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:43,186 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:43,186 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-14 16:37:43,186 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535639964]
[2021-12-14 16:37:43,186 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:43,187 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-14 16:37:43,187 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:43,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-14 16:37:43,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-12-14 16:37:43,188 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132
[2021-12-14 16:37:43,189 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 116 transitions, 296 flow. Second operand  has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,189 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:43,189 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132
[2021-12-14 16:37:43,190 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:43,553 INFO  L129       PetriNetUnfolder]: 191/561 cut-off events.
[2021-12-14 16:37:43,554 INFO  L130       PetriNetUnfolder]: For 555/569 co-relation queries the response was YES.
[2021-12-14 16:37:43,555 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 561 events. 191/561 cut-off events. For 555/569 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2627 event pairs, 7 based on Foata normal form. 20/578 useless extension candidates. Maximal degree in co-relation 1347. Up to 138 conditions per place. 
[2021-12-14 16:37:43,557 INFO  L132   encePairwiseOnDemand]: 123/132 looper letters, 30 selfloop transitions, 9 changer transitions 33/166 dead transitions.
[2021-12-14 16:37:43,557 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 166 transitions, 669 flow
[2021-12-14 16:37:43,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-14 16:37:43,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-14 16:37:43,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1164 transitions.
[2021-12-14 16:37:43,561 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8818181818181818
[2021-12-14 16:37:43,561 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1164 transitions.
[2021-12-14 16:37:43,561 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1164 transitions.
[2021-12-14 16:37:43,562 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:43,562 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1164 transitions.
[2021-12-14 16:37:43,564 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 116.4) internal successors, (1164), 10 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,567 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,567 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,567 INFO  L186             Difference]: Start difference. First operand has 138 places, 116 transitions, 296 flow. Second operand 10 states and 1164 transitions.
[2021-12-14 16:37:43,568 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 166 transitions, 669 flow
[2021-12-14 16:37:43,570 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 166 transitions, 645 flow, removed 7 selfloop flow, removed 5 redundant places.
[2021-12-14 16:37:43,572 INFO  L242             Difference]: Finished difference. Result has 142 places, 119 transitions, 364 flow
[2021-12-14 16:37:43,573 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=364, PETRI_PLACES=142, PETRI_TRANSITIONS=119}
[2021-12-14 16:37:43,573 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 18 predicate places.
[2021-12-14 16:37:43,574 INFO  L470      AbstractCegarLoop]: Abstraction has has 142 places, 119 transitions, 364 flow
[2021-12-14 16:37:43,574 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:43,574 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:43,574 INFO  L254   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, 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, 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]
[2021-12-14 16:37:43,575 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-12-14 16:37:43,575 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:43,575 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:43,575 INFO  L85        PathProgramCache]: Analyzing trace with hash 900710369, now seen corresponding path program 1 times
[2021-12-14 16:37:43,575 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:43,576 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739849512]
[2021-12-14 16:37:43,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:43,576 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:43,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:44,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:44,112 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:44,112 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739849512]
[2021-12-14 16:37:44,112 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739849512] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:44,112 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:44,112 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2021-12-14 16:37:44,113 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506652251]
[2021-12-14 16:37:44,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:44,113 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2021-12-14 16:37:44,113 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:44,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2021-12-14 16:37:44,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272
[2021-12-14 16:37:44,116 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 132
[2021-12-14 16:37:44,117 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 119 transitions, 364 flow. Second operand  has 17 states, 17 states have (on average 97.70588235294117) internal successors, (1661), 17 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:44,117 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:44,117 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 132
[2021-12-14 16:37:44,117 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:44,600 INFO  L129       PetriNetUnfolder]: 107/583 cut-off events.
[2021-12-14 16:37:44,600 INFO  L130       PetriNetUnfolder]: For 863/898 co-relation queries the response was YES.
[2021-12-14 16:37:44,603 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 583 events. 107/583 cut-off events. For 863/898 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3020 event pairs, 33 based on Foata normal form. 20/590 useless extension candidates. Maximal degree in co-relation 1294. Up to 110 conditions per place. 
[2021-12-14 16:37:44,605 INFO  L132   encePairwiseOnDemand]: 117/132 looper letters, 30 selfloop transitions, 11 changer transitions 25/153 dead transitions.
[2021-12-14 16:37:44,605 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 566 flow
[2021-12-14 16:37:44,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-12-14 16:37:44,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 17 states.
[2021-12-14 16:37:44,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1700 transitions.
[2021-12-14 16:37:44,609 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7575757575757576
[2021-12-14 16:37:44,609 INFO  L72            ComplementDD]: Start complementDD. Operand 17 states and 1700 transitions.
[2021-12-14 16:37:44,610 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 17 states and 1700 transitions.
[2021-12-14 16:37:44,610 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:44,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1700 transitions.
[2021-12-14 16:37:44,614 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 18 states, 17 states have (on average 100.0) internal successors, (1700), 17 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:44,617 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 18 states, 18 states have (on average 132.0) internal successors, (2376), 18 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:44,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 18 states, 18 states have (on average 132.0) internal successors, (2376), 18 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:44,619 INFO  L186             Difference]: Start difference. First operand has 142 places, 119 transitions, 364 flow. Second operand 17 states and 1700 transitions.
[2021-12-14 16:37:44,619 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 566 flow
[2021-12-14 16:37:44,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 153 transitions, 510 flow, removed 20 selfloop flow, removed 9 redundant places.
[2021-12-14 16:37:44,624 INFO  L242             Difference]: Finished difference. Result has 152 places, 121 transitions, 367 flow
[2021-12-14 16:37:44,625 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=367, PETRI_PLACES=152, PETRI_TRANSITIONS=121}
[2021-12-14 16:37:44,625 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 28 predicate places.
[2021-12-14 16:37:44,626 INFO  L470      AbstractCegarLoop]: Abstraction has has 152 places, 121 transitions, 367 flow
[2021-12-14 16:37:44,626 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 97.70588235294117) internal successors, (1661), 17 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:44,627 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:44,627 INFO  L254   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, 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, 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]
[2021-12-14 16:37:44,627 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-12-14 16:37:44,627 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:44,628 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:44,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -1896871700, now seen corresponding path program 1 times
[2021-12-14 16:37:44,628 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:44,628 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035755396]
[2021-12-14 16:37:44,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:44,629 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:44,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:44,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:44,843 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:44,843 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035755396]
[2021-12-14 16:37:44,844 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035755396] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:44,844 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:44,844 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-14 16:37:44,844 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270058185]
[2021-12-14 16:37:44,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:44,845 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-14 16:37:44,845 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:44,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-14 16:37:44,846 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-12-14 16:37:44,846 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 132
[2021-12-14 16:37:44,847 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 121 transitions, 367 flow. Second operand  has 8 states, 8 states have (on average 105.875) internal successors, (847), 8 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:44,847 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:44,847 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 132
[2021-12-14 16:37:44,848 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:45,139 INFO  L129       PetriNetUnfolder]: 97/515 cut-off events.
[2021-12-14 16:37:45,139 INFO  L130       PetriNetUnfolder]: For 499/513 co-relation queries the response was YES.
[2021-12-14 16:37:45,141 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 515 events. 97/515 cut-off events. For 499/513 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2467 event pairs, 42 based on Foata normal form. 9/509 useless extension candidates. Maximal degree in co-relation 1144. Up to 151 conditions per place. 
[2021-12-14 16:37:45,143 INFO  L132   encePairwiseOnDemand]: 120/132 looper letters, 25 selfloop transitions, 9 changer transitions 13/141 dead transitions.
[2021-12-14 16:37:45,143 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 141 transitions, 558 flow
[2021-12-14 16:37:45,144 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-14 16:37:45,144 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-14 16:37:45,146 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1180 transitions.
[2021-12-14 16:37:45,147 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8126721763085399
[2021-12-14 16:37:45,147 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1180 transitions.
[2021-12-14 16:37:45,147 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1180 transitions.
[2021-12-14 16:37:45,148 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:45,148 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1180 transitions.
[2021-12-14 16:37:45,150 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 107.27272727272727) internal successors, (1180), 11 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:45,152 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:45,152 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:45,153 INFO  L186             Difference]: Start difference. First operand has 152 places, 121 transitions, 367 flow. Second operand 11 states and 1180 transitions.
[2021-12-14 16:37:45,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 141 transitions, 558 flow
[2021-12-14 16:37:45,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 141 transitions, 518 flow, removed 10 selfloop flow, removed 12 redundant places.
[2021-12-14 16:37:45,158 INFO  L242             Difference]: Finished difference. Result has 151 places, 126 transitions, 411 flow
[2021-12-14 16:37:45,158 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=411, PETRI_PLACES=151, PETRI_TRANSITIONS=126}
[2021-12-14 16:37:45,160 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 27 predicate places.
[2021-12-14 16:37:45,160 INFO  L470      AbstractCegarLoop]: Abstraction has has 151 places, 126 transitions, 411 flow
[2021-12-14 16:37:45,161 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 105.875) internal successors, (847), 8 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:45,161 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:45,161 INFO  L254   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, 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, 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]
[2021-12-14 16:37:45,162 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-12-14 16:37:45,162 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:45,162 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:45,162 INFO  L85        PathProgramCache]: Analyzing trace with hash -1002144878, now seen corresponding path program 2 times
[2021-12-14 16:37:45,162 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:45,163 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573023216]
[2021-12-14 16:37:45,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:45,163 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:45,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:45,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:45,961 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:45,961 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573023216]
[2021-12-14 16:37:45,962 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573023216] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:45,962 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:45,962 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2021-12-14 16:37:45,962 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200723031]
[2021-12-14 16:37:45,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:45,963 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2021-12-14 16:37:45,963 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:45,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2021-12-14 16:37:45,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380
[2021-12-14 16:37:45,965 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 95 out of 132
[2021-12-14 16:37:45,967 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 126 transitions, 411 flow. Second operand  has 20 states, 20 states have (on average 96.55) internal successors, (1931), 20 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:45,967 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:45,967 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 132
[2021-12-14 16:37:45,967 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:46,524 INFO  L129       PetriNetUnfolder]: 98/535 cut-off events.
[2021-12-14 16:37:46,525 INFO  L130       PetriNetUnfolder]: For 831/869 co-relation queries the response was YES.
[2021-12-14 16:37:46,527 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 535 events. 98/535 cut-off events. For 831/869 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2654 event pairs, 42 based on Foata normal form. 14/534 useless extension candidates. Maximal degree in co-relation 1311. Up to 140 conditions per place. 
[2021-12-14 16:37:46,529 INFO  L132   encePairwiseOnDemand]: 115/132 looper letters, 30 selfloop transitions, 16 changer transitions 13/145 dead transitions.
[2021-12-14 16:37:46,530 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 145 transitions, 671 flow
[2021-12-14 16:37:46,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2021-12-14 16:37:46,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2021-12-14 16:37:46,533 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1860 transitions.
[2021-12-14 16:37:46,535 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7416267942583732
[2021-12-14 16:37:46,535 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1860 transitions.
[2021-12-14 16:37:46,535 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1860 transitions.
[2021-12-14 16:37:46,536 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:46,536 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1860 transitions.
[2021-12-14 16:37:46,540 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 97.89473684210526) internal successors, (1860), 19 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:46,544 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:46,545 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:46,545 INFO  L186             Difference]: Start difference. First operand has 151 places, 126 transitions, 411 flow. Second operand 19 states and 1860 transitions.
[2021-12-14 16:37:46,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 145 transitions, 671 flow
[2021-12-14 16:37:46,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 145 transitions, 584 flow, removed 38 selfloop flow, removed 9 redundant places.
[2021-12-14 16:37:46,551 INFO  L242             Difference]: Finished difference. Result has 161 places, 128 transitions, 448 flow
[2021-12-14 16:37:46,551 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=448, PETRI_PLACES=161, PETRI_TRANSITIONS=128}
[2021-12-14 16:37:46,552 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 37 predicate places.
[2021-12-14 16:37:46,552 INFO  L470      AbstractCegarLoop]: Abstraction has has 161 places, 128 transitions, 448 flow
[2021-12-14 16:37:46,553 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 96.55) internal successors, (1931), 20 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:46,553 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:46,553 INFO  L254   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, 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, 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]
[2021-12-14 16:37:46,554 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-12-14 16:37:46,554 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:46,554 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:46,554 INFO  L85        PathProgramCache]: Analyzing trace with hash 210688884, now seen corresponding path program 1 times
[2021-12-14 16:37:46,555 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:46,555 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109637547]
[2021-12-14 16:37:46,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:46,555 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:46,619 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:46,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:46,690 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:46,690 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109637547]
[2021-12-14 16:37:46,690 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109637547] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:46,690 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:46,691 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-14 16:37:46,691 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693915659]
[2021-12-14 16:37:46,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:46,691 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-14 16:37:46,692 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:46,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-14 16:37:46,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-12-14 16:37:46,693 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132
[2021-12-14 16:37:46,694 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 128 transitions, 448 flow. Second operand  has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:46,694 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:46,694 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132
[2021-12-14 16:37:46,694 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:46,992 INFO  L129       PetriNetUnfolder]: 125/510 cut-off events.
[2021-12-14 16:37:46,992 INFO  L130       PetriNetUnfolder]: For 590/606 co-relation queries the response was YES.
[2021-12-14 16:37:46,994 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 510 events. 125/510 cut-off events. For 590/606 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2554 event pairs, 14 based on Foata normal form. 16/518 useless extension candidates. Maximal degree in co-relation 1297. Up to 82 conditions per place. 
[2021-12-14 16:37:46,996 INFO  L132   encePairwiseOnDemand]: 123/132 looper letters, 25 selfloop transitions, 14 changer transitions 19/157 dead transitions.
[2021-12-14 16:37:46,996 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 157 transitions, 715 flow
[2021-12-14 16:37:46,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-14 16:37:46,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-14 16:37:46,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions.
[2021-12-14 16:37:47,000 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8629476584022039
[2021-12-14 16:37:47,000 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions.
[2021-12-14 16:37:47,000 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions.
[2021-12-14 16:37:47,001 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:47,001 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions.
[2021-12-14 16:37:47,004 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,006 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,007 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,007 INFO  L186             Difference]: Start difference. First operand has 161 places, 128 transitions, 448 flow. Second operand 11 states and 1253 transitions.
[2021-12-14 16:37:47,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 157 transitions, 715 flow
[2021-12-14 16:37:47,010 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 157 transitions, 631 flow, removed 28 selfloop flow, removed 21 redundant places.
[2021-12-14 16:37:47,013 INFO  L242             Difference]: Finished difference. Result has 150 places, 130 transitions, 437 flow
[2021-12-14 16:37:47,013 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=437, PETRI_PLACES=150, PETRI_TRANSITIONS=130}
[2021-12-14 16:37:47,014 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 26 predicate places.
[2021-12-14 16:37:47,014 INFO  L470      AbstractCegarLoop]: Abstraction has has 150 places, 130 transitions, 437 flow
[2021-12-14 16:37:47,014 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,014 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:47,015 INFO  L254   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, 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, 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, 1, 1]
[2021-12-14 16:37:47,015 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-12-14 16:37:47,015 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:47,015 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:47,016 INFO  L85        PathProgramCache]: Analyzing trace with hash 2109838569, now seen corresponding path program 1 times
[2021-12-14 16:37:47,016 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:47,016 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285624026]
[2021-12-14 16:37:47,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:47,016 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:47,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:47,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:47,240 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:47,241 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285624026]
[2021-12-14 16:37:47,241 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285624026] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:47,241 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:47,241 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-14 16:37:47,241 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81256847]
[2021-12-14 16:37:47,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:47,242 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-14 16:37:47,242 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:47,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-14 16:37:47,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2021-12-14 16:37:47,244 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 132
[2021-12-14 16:37:47,245 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 130 transitions, 437 flow. Second operand  has 11 states, 11 states have (on average 103.45454545454545) internal successors, (1138), 11 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,245 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:47,245 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 132
[2021-12-14 16:37:47,245 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:47,538 INFO  L129       PetriNetUnfolder]: 57/465 cut-off events.
[2021-12-14 16:37:47,539 INFO  L130       PetriNetUnfolder]: For 587/620 co-relation queries the response was YES.
[2021-12-14 16:37:47,540 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 465 events. 57/465 cut-off events. For 587/620 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2598 event pairs, 14 based on Foata normal form. 5/462 useless extension candidates. Maximal degree in co-relation 1089. Up to 73 conditions per place. 
[2021-12-14 16:37:47,542 INFO  L132   encePairwiseOnDemand]: 120/132 looper letters, 27 selfloop transitions, 9 changer transitions 13/144 dead transitions.
[2021-12-14 16:37:47,542 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 144 transitions, 591 flow
[2021-12-14 16:37:47,542 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-14 16:37:47,542 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-14 16:37:47,543 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1155 transitions.
[2021-12-14 16:37:47,544 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7954545454545454
[2021-12-14 16:37:47,544 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1155 transitions.
[2021-12-14 16:37:47,544 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1155 transitions.
[2021-12-14 16:37:47,545 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:47,545 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1155 transitions.
[2021-12-14 16:37:47,547 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 105.0) internal successors, (1155), 11 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,549 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,550 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 132.0) internal successors, (1584), 12 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,550 INFO  L186             Difference]: Start difference. First operand has 150 places, 130 transitions, 437 flow. Second operand 11 states and 1155 transitions.
[2021-12-14 16:37:47,550 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 144 transitions, 591 flow
[2021-12-14 16:37:47,554 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 144 transitions, 545 flow, removed 16 selfloop flow, removed 8 redundant places.
[2021-12-14 16:37:47,556 INFO  L242             Difference]: Finished difference. Result has 156 places, 130 transitions, 431 flow
[2021-12-14 16:37:47,556 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=431, PETRI_PLACES=156, PETRI_TRANSITIONS=130}
[2021-12-14 16:37:47,557 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 32 predicate places.
[2021-12-14 16:37:47,557 INFO  L470      AbstractCegarLoop]: Abstraction has has 156 places, 130 transitions, 431 flow
[2021-12-14 16:37:47,558 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 103.45454545454545) internal successors, (1138), 11 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,558 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:47,558 INFO  L254   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, 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, 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, 1, 1]
[2021-12-14 16:37:47,559 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-12-14 16:37:47,559 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:47,559 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:47,559 INFO  L85        PathProgramCache]: Analyzing trace with hash -1300298189, now seen corresponding path program 2 times
[2021-12-14 16:37:47,560 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:47,560 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402861678]
[2021-12-14 16:37:47,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:47,560 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:47,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:47,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:47,906 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:47,906 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402861678]
[2021-12-14 16:37:47,906 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402861678] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:47,906 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:47,906 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2021-12-14 16:37:47,906 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364674660]
[2021-12-14 16:37:47,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:47,907 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2021-12-14 16:37:47,907 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:47,907 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2021-12-14 16:37:47,907 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182
[2021-12-14 16:37:47,908 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 99 out of 132
[2021-12-14 16:37:47,910 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 130 transitions, 431 flow. Second operand  has 14 states, 14 states have (on average 101.07142857142857) internal successors, (1415), 14 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:47,910 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:47,910 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 132
[2021-12-14 16:37:47,910 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:48,235 INFO  L129       PetriNetUnfolder]: 48/415 cut-off events.
[2021-12-14 16:37:48,236 INFO  L130       PetriNetUnfolder]: For 320/350 co-relation queries the response was YES.
[2021-12-14 16:37:48,238 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 958 conditions, 415 events. 48/415 cut-off events. For 320/350 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2108 event pairs, 16 based on Foata normal form. 4/411 useless extension candidates. Maximal degree in co-relation 936. Up to 62 conditions per place. 
[2021-12-14 16:37:48,239 INFO  L132   encePairwiseOnDemand]: 119/132 looper letters, 24 selfloop transitions, 10 changer transitions 11/138 dead transitions.
[2021-12-14 16:37:48,239 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 138 transitions, 553 flow
[2021-12-14 16:37:48,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-12-14 16:37:48,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-12-14 16:37:48,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1330 transitions.
[2021-12-14 16:37:48,242 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7750582750582751
[2021-12-14 16:37:48,242 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1330 transitions.
[2021-12-14 16:37:48,242 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1330 transitions.
[2021-12-14 16:37:48,242 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:48,242 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1330 transitions.
[2021-12-14 16:37:48,244 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 102.3076923076923) internal successors, (1330), 13 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:48,247 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:48,247 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:48,247 INFO  L186             Difference]: Start difference. First operand has 156 places, 130 transitions, 431 flow. Second operand 13 states and 1330 transitions.
[2021-12-14 16:37:48,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 138 transitions, 553 flow
[2021-12-14 16:37:48,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 138 transitions, 509 flow, removed 11 selfloop flow, removed 11 redundant places.
[2021-12-14 16:37:48,252 INFO  L242             Difference]: Finished difference. Result has 157 places, 127 transitions, 412 flow
[2021-12-14 16:37:48,253 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=412, PETRI_PLACES=157, PETRI_TRANSITIONS=127}
[2021-12-14 16:37:48,253 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 33 predicate places.
[2021-12-14 16:37:48,254 INFO  L470      AbstractCegarLoop]: Abstraction has has 157 places, 127 transitions, 412 flow
[2021-12-14 16:37:48,254 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 101.07142857142857) internal successors, (1415), 14 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:48,254 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:48,254 INFO  L254   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, 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, 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, 1, 1]
[2021-12-14 16:37:48,255 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-12-14 16:37:48,255 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:48,255 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:48,255 INFO  L85        PathProgramCache]: Analyzing trace with hash 2024893009, now seen corresponding path program 3 times
[2021-12-14 16:37:48,256 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:48,256 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563836917]
[2021-12-14 16:37:48,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:48,256 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:48,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:48,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:48,966 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:48,966 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563836917]
[2021-12-14 16:37:48,966 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563836917] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:48,966 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:48,966 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2021-12-14 16:37:48,966 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800550351]
[2021-12-14 16:37:48,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:48,967 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2021-12-14 16:37:48,967 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:48,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2021-12-14 16:37:48,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552
[2021-12-14 16:37:48,969 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 81 out of 132
[2021-12-14 16:37:48,971 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 127 transitions, 412 flow. Second operand  has 24 states, 24 states have (on average 82.70833333333333) internal successors, (1985), 24 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:48,971 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:48,972 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 132
[2021-12-14 16:37:48,972 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:49,768 INFO  L129       PetriNetUnfolder]: 136/662 cut-off events.
[2021-12-14 16:37:49,768 INFO  L130       PetriNetUnfolder]: For 887/916 co-relation queries the response was YES.
[2021-12-14 16:37:49,770 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 662 events. 136/662 cut-off events. For 887/916 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3966 event pairs, 20 based on Foata normal form. 4/661 useless extension candidates. Maximal degree in co-relation 1692. Up to 171 conditions per place. 
[2021-12-14 16:37:49,772 INFO  L132   encePairwiseOnDemand]: 112/132 looper letters, 48 selfloop transitions, 20 changer transitions 39/179 dead transitions.
[2021-12-14 16:37:49,772 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 179 transitions, 912 flow
[2021-12-14 16:37:49,772 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2021-12-14 16:37:49,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2021-12-14 16:37:49,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1716 transitions.
[2021-12-14 16:37:49,775 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.65
[2021-12-14 16:37:49,775 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1716 transitions.
[2021-12-14 16:37:49,775 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1716 transitions.
[2021-12-14 16:37:49,775 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:49,776 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1716 transitions.
[2021-12-14 16:37:49,778 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 85.8) internal successors, (1716), 20 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:49,781 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 132.0) internal successors, (2772), 21 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:49,782 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 132.0) internal successors, (2772), 21 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:49,782 INFO  L186             Difference]: Start difference. First operand has 157 places, 127 transitions, 412 flow. Second operand 20 states and 1716 transitions.
[2021-12-14 16:37:49,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 179 transitions, 912 flow
[2021-12-14 16:37:49,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 179 transitions, 795 flow, removed 26 selfloop flow, removed 14 redundant places.
[2021-12-14 16:37:49,788 INFO  L242             Difference]: Finished difference. Result has 167 places, 132 transitions, 477 flow
[2021-12-14 16:37:49,788 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=477, PETRI_PLACES=167, PETRI_TRANSITIONS=132}
[2021-12-14 16:37:49,789 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 43 predicate places.
[2021-12-14 16:37:49,789 INFO  L470      AbstractCegarLoop]: Abstraction has has 167 places, 132 transitions, 477 flow
[2021-12-14 16:37:49,790 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 82.70833333333333) internal successors, (1985), 24 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:49,790 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:49,790 INFO  L254   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, 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, 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, 1, 1]
[2021-12-14 16:37:49,790 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-12-14 16:37:49,790 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:49,791 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:49,791 INFO  L85        PathProgramCache]: Analyzing trace with hash -304575853, now seen corresponding path program 4 times
[2021-12-14 16:37:49,791 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:49,791 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980264888]
[2021-12-14 16:37:49,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:49,792 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:49,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:50,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:50,203 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:50,203 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980264888]
[2021-12-14 16:37:50,203 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980264888] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:50,203 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:50,203 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-12-14 16:37:50,203 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224893643]
[2021-12-14 16:37:50,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:50,204 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-12-14 16:37:50,204 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:50,204 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-12-14 16:37:50,204 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240
[2021-12-14 16:37:50,205 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 132
[2021-12-14 16:37:50,207 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 132 transitions, 477 flow. Second operand  has 16 states, 16 states have (on average 90.1875) internal successors, (1443), 16 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:50,207 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:50,207 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 132
[2021-12-14 16:37:50,207 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:50,596 INFO  L129       PetriNetUnfolder]: 57/393 cut-off events.
[2021-12-14 16:37:50,596 INFO  L130       PetriNetUnfolder]: For 487/510 co-relation queries the response was YES.
[2021-12-14 16:37:50,598 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 999 conditions, 393 events. 57/393 cut-off events. For 487/510 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1819 event pairs, 4 based on Foata normal form. 8/396 useless extension candidates. Maximal degree in co-relation 975. Up to 68 conditions per place. 
[2021-12-14 16:37:50,599 INFO  L132   encePairwiseOnDemand]: 117/132 looper letters, 33 selfloop transitions, 16 changer transitions 13/149 dead transitions.
[2021-12-14 16:37:50,599 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 149 transitions, 687 flow
[2021-12-14 16:37:50,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-12-14 16:37:50,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-12-14 16:37:50,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1464 transitions.
[2021-12-14 16:37:50,604 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6931818181818182
[2021-12-14 16:37:50,604 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1464 transitions.
[2021-12-14 16:37:50,605 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1464 transitions.
[2021-12-14 16:37:50,606 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:50,606 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1464 transitions.
[2021-12-14 16:37:50,610 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 91.5) internal successors, (1464), 16 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:50,613 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:50,613 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:50,613 INFO  L186             Difference]: Start difference. First operand has 167 places, 132 transitions, 477 flow. Second operand 16 states and 1464 transitions.
[2021-12-14 16:37:50,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 149 transitions, 687 flow
[2021-12-14 16:37:50,617 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 605 flow, removed 20 selfloop flow, removed 21 redundant places.
[2021-12-14 16:37:50,619 INFO  L242             Difference]: Finished difference. Result has 157 places, 134 transitions, 477 flow
[2021-12-14 16:37:50,619 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=477, PETRI_PLACES=157, PETRI_TRANSITIONS=134}
[2021-12-14 16:37:50,620 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 33 predicate places.
[2021-12-14 16:37:50,620 INFO  L470      AbstractCegarLoop]: Abstraction has has 157 places, 134 transitions, 477 flow
[2021-12-14 16:37:50,621 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 90.1875) internal successors, (1443), 16 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:50,621 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:50,621 INFO  L254   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, 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, 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, 1, 1]
[2021-12-14 16:37:50,621 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-12-14 16:37:50,622 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:50,622 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:50,622 INFO  L85        PathProgramCache]: Analyzing trace with hash -236830015, now seen corresponding path program 5 times
[2021-12-14 16:37:50,622 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:50,622 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748085731]
[2021-12-14 16:37:50,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:50,623 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:50,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:51,260 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:51,261 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:51,261 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748085731]
[2021-12-14 16:37:51,261 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748085731] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:51,261 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:51,261 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2021-12-14 16:37:51,261 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494092950]
[2021-12-14 16:37:51,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:51,262 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2021-12-14 16:37:51,262 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:51,262 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2021-12-14 16:37:51,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342
[2021-12-14 16:37:51,263 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 132
[2021-12-14 16:37:51,265 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 134 transitions, 477 flow. Second operand  has 19 states, 19 states have (on average 87.94736842105263) internal successors, (1671), 19 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:51,265 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:51,265 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 132
[2021-12-14 16:37:51,265 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:51,837 INFO  L129       PetriNetUnfolder]: 57/405 cut-off events.
[2021-12-14 16:37:51,837 INFO  L130       PetriNetUnfolder]: For 464/492 co-relation queries the response was YES.
[2021-12-14 16:37:51,839 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 959 conditions, 405 events. 57/405 cut-off events. For 464/492 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1925 event pairs, 7 based on Foata normal form. 6/405 useless extension candidates. Maximal degree in co-relation 940. Up to 56 conditions per place. 
[2021-12-14 16:37:51,840 INFO  L132   encePairwiseOnDemand]: 114/132 looper letters, 29 selfloop transitions, 18 changer transitions 24/155 dead transitions.
[2021-12-14 16:37:51,840 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 155 transitions, 726 flow
[2021-12-14 16:37:51,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2021-12-14 16:37:51,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2021-12-14 16:37:51,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1784 transitions.
[2021-12-14 16:37:51,843 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.6757575757575758
[2021-12-14 16:37:51,843 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1784 transitions.
[2021-12-14 16:37:51,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1784 transitions.
[2021-12-14 16:37:51,844 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:51,844 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1784 transitions.
[2021-12-14 16:37:51,847 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 89.2) internal successors, (1784), 20 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:51,851 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 132.0) internal successors, (2772), 21 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:51,852 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 132.0) internal successors, (2772), 21 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:51,852 INFO  L186             Difference]: Start difference. First operand has 157 places, 134 transitions, 477 flow. Second operand 20 states and 1784 transitions.
[2021-12-14 16:37:51,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 155 transitions, 726 flow
[2021-12-14 16:37:51,855 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 155 transitions, 685 flow, removed 15 selfloop flow, removed 11 redundant places.
[2021-12-14 16:37:51,858 INFO  L242             Difference]: Finished difference. Result has 166 places, 130 transitions, 472 flow
[2021-12-14 16:37:51,858 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=472, PETRI_PLACES=166, PETRI_TRANSITIONS=130}
[2021-12-14 16:37:51,860 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 42 predicate places.
[2021-12-14 16:37:51,860 INFO  L470      AbstractCegarLoop]: Abstraction has has 166 places, 130 transitions, 472 flow
[2021-12-14 16:37:51,861 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 87.94736842105263) internal successors, (1671), 19 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:51,861 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:51,861 INFO  L254   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, 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, 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, 1, 1]
[2021-12-14 16:37:51,861 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-12-14 16:37:51,862 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:51,862 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:51,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -69436943, now seen corresponding path program 6 times
[2021-12-14 16:37:51,862 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:51,862 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304429372]
[2021-12-14 16:37:51,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:51,863 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:51,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-14 16:37:52,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-14 16:37:52,376 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-14 16:37:52,376 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304429372]
[2021-12-14 16:37:52,376 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304429372] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-14 16:37:52,376 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-14 16:37:52,376 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2021-12-14 16:37:52,376 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785567615]
[2021-12-14 16:37:52,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-14 16:37:52,377 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2021-12-14 16:37:52,377 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-14 16:37:52,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2021-12-14 16:37:52,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240
[2021-12-14 16:37:52,378 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 132
[2021-12-14 16:37:52,379 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 130 transitions, 472 flow. Second operand  has 16 states, 16 states have (on average 91.1875) internal successors, (1459), 16 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:52,379 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-14 16:37:52,379 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 132
[2021-12-14 16:37:52,380 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-14 16:37:52,715 INFO  L129       PetriNetUnfolder]: 43/326 cut-off events.
[2021-12-14 16:37:52,715 INFO  L130       PetriNetUnfolder]: For 606/630 co-relation queries the response was YES.
[2021-12-14 16:37:52,716 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 812 conditions, 326 events. 43/326 cut-off events. For 606/630 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1320 event pairs, 7 based on Foata normal form. 4/326 useless extension candidates. Maximal degree in co-relation 792. Up to 39 conditions per place. 
[2021-12-14 16:37:52,718 INFO  L132   encePairwiseOnDemand]: 119/132 looper letters, 32 selfloop transitions, 9 changer transitions 13/140 dead transitions.
[2021-12-14 16:37:52,718 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 140 transitions, 633 flow
[2021-12-14 16:37:52,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2021-12-14 16:37:52,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2021-12-14 16:37:52,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1294 transitions.
[2021-12-14 16:37:52,720 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7002164502164502
[2021-12-14 16:37:52,721 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1294 transitions.
[2021-12-14 16:37:52,721 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1294 transitions.
[2021-12-14 16:37:52,721 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-14 16:37:52,721 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1294 transitions.
[2021-12-14 16:37:52,723 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 92.42857142857143) internal successors, (1294), 14 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:52,725 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:52,726 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 132.0) internal successors, (1980), 15 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:52,726 INFO  L186             Difference]: Start difference. First operand has 166 places, 130 transitions, 472 flow. Second operand 14 states and 1294 transitions.
[2021-12-14 16:37:52,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 140 transitions, 633 flow
[2021-12-14 16:37:52,729 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 140 transitions, 569 flow, removed 12 selfloop flow, removed 18 redundant places.
[2021-12-14 16:37:52,730 INFO  L242             Difference]: Finished difference. Result has 156 places, 126 transitions, 414 flow
[2021-12-14 16:37:52,731 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=414, PETRI_PLACES=156, PETRI_TRANSITIONS=126}
[2021-12-14 16:37:52,731 INFO  L334   CegarLoopForPetriNet]: 124 programPoint places, 32 predicate places.
[2021-12-14 16:37:52,731 INFO  L470      AbstractCegarLoop]: Abstraction has has 156 places, 126 transitions, 414 flow
[2021-12-14 16:37:52,732 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 91.1875) internal successors, (1459), 16 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-14 16:37:52,732 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-14 16:37:52,732 INFO  L254   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, 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, 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, 1, 1]
[2021-12-14 16:37:52,732 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-12-14 16:37:52,733 INFO  L402      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] ===
[2021-12-14 16:37:52,733 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-14 16:37:52,733 INFO  L85        PathProgramCache]: Analyzing trace with hash -415172015, now seen corresponding path program 7 times
[2021-12-14 16:37:52,733 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-14 16:37:52,733 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680120659]
[2021-12-14 16:37:52,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-14 16:37:52,734 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-14 16:37:52,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-14 16:37:52,826 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-14 16:37:52,929 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-14 16:37:52,992 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-14 16:37:52,994 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2021-12-14 16:37:52,995 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining)
[2021-12-14 16:37:52,997 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining)
[2021-12-14 16:37:52,997 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining)
[2021-12-14 16:37:52,998 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining)
[2021-12-14 16:37:52,998 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-12-14 16:37:53,001 INFO  L732         BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1, 1, 1, 1]
[2021-12-14 16:37:53,008 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-12-14 16:37:53,008 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-12-14 16:37:53,175 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 04:37:53 BasicIcfg
[2021-12-14 16:37:53,175 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-12-14 16:37:53,176 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-12-14 16:37:53,176 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-12-14 16:37:53,176 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-12-14 16:37:53,177 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:37:39" (3/4) ...
[2021-12-14 16:37:53,178 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-12-14 16:37:53,309 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-12-14 16:37:53,310 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-12-14 16:37:53,310 INFO  L158              Benchmark]: Toolchain (without parser) took 16012.83ms. Allocated memory was 94.4MB in the beginning and 318.8MB in the end (delta: 224.4MB). Free memory was 62.2MB in the beginning and 115.7MB in the end (delta: -53.5MB). Peak memory consumption was 170.4MB. Max. memory is 16.1GB.
[2021-12-14 16:37:53,311 INFO  L158              Benchmark]: CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2021-12-14 16:37:53,311 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 534.09ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 54.0MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2021-12-14 16:37:53,311 INFO  L158              Benchmark]: Boogie Procedure Inliner took 56.70ms. Allocated memory is still 94.4MB. Free memory was 54.0MB in the beginning and 51.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2021-12-14 16:37:53,311 INFO  L158              Benchmark]: Boogie Preprocessor took 50.24ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 48.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2021-12-14 16:37:53,312 INFO  L158              Benchmark]: RCFGBuilder took 1463.18ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 47.8MB in the beginning and 72.1MB in the end (delta: -24.3MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB.
[2021-12-14 16:37:53,312 INFO  L158              Benchmark]: TraceAbstraction took 13768.91ms. Allocated memory was 121.6MB in the beginning and 318.8MB in the end (delta: 197.1MB). Free memory was 71.8MB in the beginning and 184.8MB in the end (delta: -113.0MB). Peak memory consumption was 179.6MB. Max. memory is 16.1GB.
[2021-12-14 16:37:53,312 INFO  L158              Benchmark]: Witness Printer took 134.07ms. Allocated memory is still 318.8MB. Free memory was 184.8MB in the beginning and 115.7MB in the end (delta: 69.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB.
[2021-12-14 16:37:53,314 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.27ms. Allocated memory is still 94.4MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 534.09ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 54.0MB in the end (delta: 8.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 56.70ms. Allocated memory is still 94.4MB. Free memory was 54.0MB in the beginning and 51.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 50.24ms. Allocated memory is still 94.4MB. Free memory was 51.0MB in the beginning and 48.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1463.18ms. Allocated memory was 94.4MB in the beginning and 121.6MB in the end (delta: 27.3MB). Free memory was 47.8MB in the beginning and 72.1MB in the end (delta: -24.3MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 13768.91ms. Allocated memory was 121.6MB in the beginning and 318.8MB in the end (delta: 197.1MB). Free memory was 71.8MB in the beginning and 184.8MB in the end (delta: -113.0MB). Peak memory consumption was 179.6MB. Max. memory is 16.1GB.
 * Witness Printer took 134.07ms. Allocated memory is still 318.8MB. Free memory was 184.8MB in the beginning and 115.7MB in the end (delta: 69.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L712]               0  int __unbuffered_p0_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L714]               0  int __unbuffered_p0_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0]
[L716]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0]
[L717]               0  _Bool __unbuffered_p2_EAX$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0]
[L718]               0  int __unbuffered_p2_EAX$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0]
[L719]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0]
[L720]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0]
[L721]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0]
[L722]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0]
[L723]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0]
[L724]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0]
[L725]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0]
[L726]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0]
[L727]               0  _Bool __unbuffered_p2_EAX$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0]
[L728]               0  int *__unbuffered_p2_EAX$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}]
[L729]               0  int __unbuffered_p2_EAX$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0]
[L730]               0  _Bool __unbuffered_p2_EAX$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0]
[L731]               0  int __unbuffered_p2_EAX$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0]
[L732]               0  _Bool __unbuffered_p2_EAX$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0]
[L733]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0]
[L734]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L736]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}]
[L737]               0  _Bool x$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0]
[L738]               0  int x$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0]
[L739]               0  _Bool x$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L740]               0  _Bool x$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L741]               0  _Bool x$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L742]               0  _Bool x$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L743]               0  _Bool x$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0]
[L744]               0  _Bool x$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L745]               0  _Bool x$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L746]               0  _Bool x$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L747]               0  _Bool x$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0]
[L748]               0  int *x$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L749]               0  int x$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L750]               0  _Bool x$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L751]               0  int x$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L752]               0  _Bool x$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L754]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L755]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L756]               0  _Bool weak$$choice1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L757]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L852]               0  pthread_t t2112;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, t2112={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L853]  FCALL, FORK  0  pthread_create(&t2112, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2112, ((void *)0), P0, ((void *)0))=-1, t2112={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L854]               0  pthread_t t2113;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2112={7:0}, t2113={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L855]  FCALL, FORK  0  pthread_create(&t2113, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2113, ((void *)0), P1, ((void *)0))=0, t2112={7:0}, t2113={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L856]               0  pthread_t t2114;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2112={7:0}, t2113={5:0}, t2114={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L857]  FCALL, FORK  0  pthread_create(&t2114, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2114, ((void *)0), P2, ((void *)0))=1, t2112={7:0}, t2113={5:0}, t2114={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L809]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L810]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L811]               3  x$flush_delayed = weak$$choice2
[L812]  EXPR         3  \read(x)
[L812]               3  x$mem_tmp = x
[L813]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L813]  EXPR         3  \read(x)
[L813]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L813]               3  x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L814]  EXPR         3  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L814]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)
[L814]  EXPR         3  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L814]               3  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L815]  EXPR         3  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L815]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)
[L815]  EXPR         3  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L815]               3  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L816]  EXPR         3  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L816]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)
[L816]  EXPR         3  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L816]               3  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L817]  EXPR         3  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L817]  EXPR         3  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L818]  EXPR         3  weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L818]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)
[L818]  EXPR         3  weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L818]               3  x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L819]  EXPR         3  weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L819]  EXPR         3  weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819]               3  x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L820]               3  __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L821]               3  __unbuffered_p2_EAX$read_delayed_var = &x
[L822]  EXPR         3  \read(x)
[L822]               3  __unbuffered_p2_EAX = x
[L823]  EXPR         3  x$flush_delayed ? x$mem_tmp : x
[L823]  EXPR         3  \read(x)
[L823]  EXPR         3  x$flush_delayed ? x$mem_tmp : x
[L823]               3  x = x$flush_delayed ? x$mem_tmp : x
[L824]               3  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L827]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L761]               1  __unbuffered_p0_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L764]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L765]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L766]               1  x$flush_delayed = weak$$choice2
[L767]  EXPR         1  \read(x)
[L767]               1  x$mem_tmp = x
[L768]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L768]  EXPR         1  \read(x)
[L768]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L768]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L769]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L769]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)
[L769]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L769]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L770]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L770]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)
[L770]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L770]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L771]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L771]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)
[L771]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L771]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L772]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L772]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L772]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L772]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L773]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L773]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)
[L773]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L773]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L774]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L774]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L774]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L774]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L775]  EXPR         1  \read(x)
[L775]               1  __unbuffered_p0_EBX = x
[L776]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L776]  EXPR         1  \read(x)
[L776]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L776]               1  x = x$flush_delayed ? x$mem_tmp : x
[L777]               1  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L830]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L830]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L830]  EXPR         3  \read(x)
[L830]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L830]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L830]               3  x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L831]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L831]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L832]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L832]               3  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L833]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L833]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L834]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L834]               3  x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L789]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L792]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L795]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L795]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L795]  EXPR         2  \read(x)
[L795]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L795]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L795]               2  x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L796]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L796]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L797]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L797]               2  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L798]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L798]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L799]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L799]               2  x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L802]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L837]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L782]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L859]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2112={7:0}, t2113={5:0}, t2114={8:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L861]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L861]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L863]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L863]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L863]  EXPR         0  \read(x)
[L863]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L863]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L863]               0  x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L864]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L864]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L865]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L865]               0  x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L866]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L866]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L867]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L867]               0  x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L870]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L871]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L872]               0  x$flush_delayed = weak$$choice2
[L873]  EXPR         0  \read(x)
[L873]               0  x$mem_tmp = x
[L874]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L874]  EXPR         0  \read(x)
[L874]  EXPR         0  !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L874]               0  x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L875]  EXPR         0  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L875]               0  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L876]  EXPR         0  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L876]               0  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L877]  EXPR         0  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L877]               0  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L878]  EXPR         0  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L878]               0  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L879]  EXPR         0  weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L879]               0  x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L880]  EXPR         0  weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880]               0  x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L882]  EXPR         0  __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L882]  EXPR         0  weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L882]  EXPR         0  \read(*__unbuffered_p2_EAX$read_delayed_var)
[L882]  EXPR         0  weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L882]  EXPR         0  __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L882]               0  __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L883]  EXPR         0  \read(x)
[L883]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2)
[L884]  EXPR         0  x$flush_delayed ? x$mem_tmp : x
[L884]               0  x = x$flush_delayed ? x$mem_tmp : x
[L885]               0  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2112={7:0}, t2113={5:0}, t2114={8:0}, weak$$choice0=4, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L887]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]
[L19]                0  reach_error()
        VAL             [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1]

  - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 157 locations, 4 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: 13.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 835 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 835 mSDsluCounter, 1315 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1703 mSDsCounter, 405 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2777 IncrementalHoareTripleChecker+Invalid, 3182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 405 mSolverCounterUnsat, 205 mSDtfsCounter, 2777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=12, InterpolantAutomatonStates: 201, 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, 1.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1525 ConstructedInterpolants, 0 QuantifiedInterpolants, 11986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2021-12-14 16:37:53,358 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE