./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version e19ca921
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/safe004_power.oepc_pso.oepc_rmo.oepc.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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-e19ca92
[2021-12-22 13:31:26,469 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-12-22 13:31:26,498 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-22 13:31:26,524 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-22 13:31:26,524 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-22 13:31:26,525 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-22 13:31:26,526 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-22 13:31:26,527 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-22 13:31:26,528 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-22 13:31:26,529 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-22 13:31:26,530 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-12-22 13:31:26,530 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-22 13:31:26,531 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-22 13:31:26,531 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-22 13:31:26,532 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-22 13:31:26,533 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-22 13:31:26,533 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-22 13:31:26,534 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-22 13:31:26,535 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-22 13:31:26,537 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-22 13:31:26,541 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-22 13:31:26,542 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-22 13:31:26,543 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-12-22 13:31:26,544 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-22 13:31:26,546 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-22 13:31:26,549 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-22 13:31:26,549 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-22 13:31:26,550 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-22 13:31:26,551 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-22 13:31:26,552 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-22 13:31:26,553 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-22 13:31:26,553 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-22 13:31:26,554 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-22 13:31:26,555 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-22 13:31:26,556 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-22 13:31:26,556 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-22 13:31:26,557 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-22 13:31:26,557 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-22 13:31:26,557 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-22 13:31:26,558 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-22 13:31:26,559 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-12-22 13:31:26,560 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-12-22 13:31:26,579 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-12-22 13:31:26,580 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-22 13:31:26,580 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-22 13:31:26,580 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-22 13:31:26,581 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-22 13:31:26,581 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-22 13:31:26,582 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-22 13:31:26,582 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-12-22 13:31:26,582 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-12-22 13:31:26,582 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-22 13:31:26,583 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-12-22 13:31:26,583 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-12-22 13:31:26,583 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-12-22 13:31:26,583 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-12-22 13:31:26,583 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-12-22 13:31:26,583 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-22 13:31:26,584 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-12-22 13:31:26,584 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-12-22 13:31:26,584 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-12-22 13:31:26,584 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-12-22 13:31:26,584 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-12-22 13:31:26,584 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-22 13:31:26,585 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-12-22 13:31:26,585 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-12-22 13:31:26,585 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-22 13:31:26,585 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-22 13:31:26,585 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-12-22 13:31:26,585 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-12-22 13:31:26,586 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-12-22 13:31:26,586 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-12-22 13:31:26,586 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-12-22 13:31:26,586 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2021-12-22 13:31:26,586 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-12-22 13:31:26,586 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-12-22 13:31:26,587 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3
[2021-12-22 13:31:26,756 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-22 13:31:26,770 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-22 13:31:26,772 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-22 13:31:26,773 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-12-22 13:31:26,773 INFO  L275        PluginConnector]: CDTParser initialized
[2021-12-22 13:31:26,774 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2021-12-22 13:31:26,825 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66076d153/a408c0e6c31f4bd8b86c4716ef23df76/FLAG1e6af23f2
[2021-12-22 13:31:27,264 INFO  L306              CDTParser]: Found 1 translation units.
[2021-12-22 13:31:27,264 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i
[2021-12-22 13:31:27,278 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66076d153/a408c0e6c31f4bd8b86c4716ef23df76/FLAG1e6af23f2
[2021-12-22 13:31:27,287 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66076d153/a408c0e6c31f4bd8b86c4716ef23df76
[2021-12-22 13:31:27,296 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-22 13:31:27,299 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-22 13:31:27,302 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-22 13:31:27,302 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-22 13:31:27,304 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-22 13:31:27,305 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,305 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8deb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27, skipping insertion in model container
[2021-12-22 13:31:27,306 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,310 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-12-22 13:31:27,341 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-12-22 13:31:27,470 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/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983]
[2021-12-22 13:31:27,622 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-22 13:31:27,630 INFO  L203         MainTranslator]: Completed pre-run
[2021-12-22 13:31:27,642 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/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983]
[2021-12-22 13:31:27,685 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2021-12-22 13:31:27,712 INFO  L208         MainTranslator]: Completed translation
[2021-12-22 13:31:27,712 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27 WrapperNode
[2021-12-22 13:31:27,713 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-22 13:31:27,714 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-22 13:31:27,714 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-22 13:31:27,714 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-22 13:31:27,719 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,752 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,785 INFO  L137                Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 274
[2021-12-22 13:31:27,788 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-22 13:31:27,789 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-22 13:31:27,789 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-22 13:31:27,789 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-12-22 13:31:27,796 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,796 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,815 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,815 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,823 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,841 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,844 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,866 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-22 13:31:27,867 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-22 13:31:27,867 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-12-22 13:31:27,867 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-12-22 13:31:27,868 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (1/1) ...
[2021-12-22 13:31:27,873 INFO  L168          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-22 13:31:27,881 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-22 13:31:27,892 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-22 13:31:27,912 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-22 13:31:27,923 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-12-22 13:31:27,924 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-12-22 13:31:27,924 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2021-12-22 13:31:27,924 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-22 13:31:27,924 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-22 13:31:27,924 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-12-22 13:31:27,924 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-12-22 13:31:27,924 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-12-22 13:31:27,925 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-12-22 13:31:27,925 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-12-22 13:31:27,925 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-12-22 13:31:27,925 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-12-22 13:31:27,925 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-12-22 13:31:27,925 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-22 13:31:27,925 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-22 13:31:27,927 WARN  L208             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-12-22 13:31:28,081 INFO  L234             CfgBuilder]: Building ICFG
[2021-12-22 13:31:28,082 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-22 13:31:28,599 INFO  L275             CfgBuilder]: Performing block encoding
[2021-12-22 13:31:29,047 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-22 13:31:29,048 INFO  L299             CfgBuilder]: Removed 0 assume(true) statements.
[2021-12-22 13:31:29,050 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:31:29 BoogieIcfgContainer
[2021-12-22 13:31:29,050 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-22 13:31:29,052 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-12-22 13:31:29,052 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-12-22 13:31:29,055 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-12-22 13:31:29,055 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:31:27" (1/3) ...
[2021-12-22 13:31:29,056 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c6f871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:31:29, skipping insertion in model container
[2021-12-22 13:31:29,056 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:31:27" (2/3) ...
[2021-12-22 13:31:29,056 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c6f871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:31:29, skipping insertion in model container
[2021-12-22 13:31:29,056 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:31:29" (3/3) ...
[2021-12-22 13:31:29,058 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i
[2021-12-22 13:31:29,062 WARN  L149   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-12-22 13:31:29,062 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-12-22 13:31:29,062 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-12-22 13:31:29,062 INFO  L513   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-12-22 13:31:29,135 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,136 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,136 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,136 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,136 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,137 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,137 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,137 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,137 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,138 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,138 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,138 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,139 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,139 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,139 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,139 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,140 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,140 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,140 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,141 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,141 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,141 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,141 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,142 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,142 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,142 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,143 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,143 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,143 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,143 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,145 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,145 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,145 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,145 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,146 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,146 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,146 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,146 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,146 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,146 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,147 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,147 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,147 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,147 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,148 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,148 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,148 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,148 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,148 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,149 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,149 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,149 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,149 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,149 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,149 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,150 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,150 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,150 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,151 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,151 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,151 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,152 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,152 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,152 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,152 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,152 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,153 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,153 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,153 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,153 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,153 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,154 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,154 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,154 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,154 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,154 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,154 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,154 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,155 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,155 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,157 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,157 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,158 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,158 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,159 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,159 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,159 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,159 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,159 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,163 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,163 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,163 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,164 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,164 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,164 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,164 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,164 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,164 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,164 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,165 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,165 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,165 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,165 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,166 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,166 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,166 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,168 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,168 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,168 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,168 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,168 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,169 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,169 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,169 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,169 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,169 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,169 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,169 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,170 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,170 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,170 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,170 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,170 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,170 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,170 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,171 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,171 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,171 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,171 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,171 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,171 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,171 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,172 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,173 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,173 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,173 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,175 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,175 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,175 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,176 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,176 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,176 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,176 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,176 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,177 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,178 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,179 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,180 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,181 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,181 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,181 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,181 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,183 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,183 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,183 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,183 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,183 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,183 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,184 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,185 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,186 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,186 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,189 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,190 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,190 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,191 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,191 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,191 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,193 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,193 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,193 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,193 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,194 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,194 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,194 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,199 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,200 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,200 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,200 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,200 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,200 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,200 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,201 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,201 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,201 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,201 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,204 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,205 WARN  L322   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,205 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,205 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,205 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,205 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,205 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,205 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,206 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,206 WARN  L322   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,207 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,207 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,207 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,208 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,209 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,209 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,209 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,209 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,209 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,209 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,209 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,210 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,211 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,211 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,211 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,211 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,211 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,211 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,211 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,212 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,213 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,214 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,214 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,214 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,214 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,214 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,214 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,214 WARN  L322   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,215 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,215 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,215 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,216 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,216 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,216 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,216 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,216 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,216 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,216 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,217 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,217 WARN  L322   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-12-22 13:31:29,217 INFO  L148    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-12-22 13:31:29,258 INFO  L338      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-12-22 13:31:29,263 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-22 13:31:29,263 INFO  L340      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2021-12-22 13:31:29,274 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow
[2021-12-22 13:31:29,314 INFO  L129       PetriNetUnfolder]: 2/111 cut-off events.
[2021-12-22 13:31:29,314 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-22 13:31:29,317 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. 
[2021-12-22 13:31:29,317 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow
[2021-12-22 13:31:29,321 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow
[2021-12-22 13:31:29,331 INFO  L129       PetriNetUnfolder]: 0/46 cut-off events.
[2021-12-22 13:31:29,331 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-12-22 13:31:29,332 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:29,332 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]
[2021-12-22 13:31:29,333 INFO  L402      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:29,338 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:29,339 INFO  L85        PathProgramCache]: Analyzing trace with hash 1877201928, now seen corresponding path program 1 times
[2021-12-22 13:31:29,345 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:29,346 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519485505]
[2021-12-22 13:31:29,346 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:29,347 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:29,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:29,595 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-22 13:31:29,595 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:29,596 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519485505]
[2021-12-22 13:31:29,596 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519485505] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:29,597 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:29,597 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-22 13:31:29,598 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628803994]
[2021-12-22 13:31:29,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:29,606 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-22 13:31:29,606 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:29,629 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-22 13:31:29,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 13:31:29,634 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 114
[2021-12-22 13:31:29,639 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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-22 13:31:29,639 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:29,639 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 114
[2021-12-22 13:31:29,640 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:29,820 INFO  L129       PetriNetUnfolder]: 124/549 cut-off events.
[2021-12-22 13:31:29,820 INFO  L130       PetriNetUnfolder]: For 10/10 co-relation queries the response was YES.
[2021-12-22 13:31:29,823 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 780 conditions, 549 events. 124/549 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2968 event pairs, 24 based on Foata normal form. 23/541 useless extension candidates. Maximal degree in co-relation 729. Up to 155 conditions per place. 
[2021-12-22 13:31:29,825 INFO  L132   encePairwiseOnDemand]: 109/114 looper letters, 18 selfloop transitions, 2 changer transitions 0/115 dead transitions.
[2021-12-22 13:31:29,825 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 115 transitions, 285 flow
[2021-12-22 13:31:29,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-12-22 13:31:29,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2021-12-22 13:31:29,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions.
[2021-12-22 13:31:29,835 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.9327485380116959
[2021-12-22 13:31:29,835 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 319 transitions.
[2021-12-22 13:31:29,836 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions.
[2021-12-22 13:31:29,837 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:29,838 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions.
[2021-12-22 13:31:29,850 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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-22 13:31:29,855 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-22 13:31:29,856 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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-22 13:31:29,857 INFO  L186             Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 319 transitions.
[2021-12-22 13:31:29,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 115 transitions, 285 flow
[2021-12-22 13:31:29,862 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 115 transitions, 280 flow, removed 0 selfloop flow, removed 3 redundant places.
[2021-12-22 13:31:29,864 INFO  L242             Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow
[2021-12-22 13:31:29,866 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107}
[2021-12-22 13:31:29,870 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places.
[2021-12-22 13:31:29,870 INFO  L470      AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow
[2021-12-22 13:31:29,870 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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-22 13:31:29,870 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:29,870 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]
[2021-12-22 13:31:29,870 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-12-22 13:31:29,871 INFO  L402      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:29,872 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:29,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 185903545, now seen corresponding path program 1 times
[2021-12-22 13:31:29,872 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:29,872 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228667101]
[2021-12-22 13:31:29,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:29,872 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:29,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:30,041 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-22 13:31:30,041 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:30,042 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228667101]
[2021-12-22 13:31:30,042 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228667101] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:30,042 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:30,042 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:30,042 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935033645]
[2021-12-22 13:31:30,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:30,043 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:30,043 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:30,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:30,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:30,045 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114
[2021-12-22 13:31:30,045 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand  has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 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-22 13:31:30,045 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:30,046 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114
[2021-12-22 13:31:30,046 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:30,621 INFO  L129       PetriNetUnfolder]: 1153/3081 cut-off events.
[2021-12-22 13:31:30,622 INFO  L130       PetriNetUnfolder]: For 136/136 co-relation queries the response was YES.
[2021-12-22 13:31:30,627 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5002 conditions, 3081 events. 1153/3081 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 24531 event pairs, 257 based on Foata normal form. 0/2991 useless extension candidates. Maximal degree in co-relation 4951. Up to 992 conditions per place. 
[2021-12-22 13:31:30,633 INFO  L132   encePairwiseOnDemand]: 107/114 looper letters, 25 selfloop transitions, 3 changer transitions 63/167 dead transitions.
[2021-12-22 13:31:30,634 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 167 transitions, 522 flow
[2021-12-22 13:31:30,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:30,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:30,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions.
[2021-12-22 13:31:30,637 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8693957115009746
[2021-12-22 13:31:30,637 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 892 transitions.
[2021-12-22 13:31:30,637 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions.
[2021-12-22 13:31:30,638 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:30,638 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions.
[2021-12-22 13:31:30,639 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 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-22 13:31:30,642 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:30,642 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:30,642 INFO  L186             Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 9 states and 892 transitions.
[2021-12-22 13:31:30,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 167 transitions, 522 flow
[2021-12-22 13:31:30,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 167 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places.
[2021-12-22 13:31:30,645 INFO  L242             Difference]: Finished difference. Result has 129 places, 97 transitions, 239 flow
[2021-12-22 13:31:30,645 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=239, PETRI_PLACES=129, PETRI_TRANSITIONS=97}
[2021-12-22 13:31:30,646 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 10 predicate places.
[2021-12-22 13:31:30,646 INFO  L470      AbstractCegarLoop]: Abstraction has has 129 places, 97 transitions, 239 flow
[2021-12-22 13:31:30,646 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 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-22 13:31:30,647 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:30,647 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]
[2021-12-22 13:31:30,647 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-12-22 13:31:30,647 INFO  L402      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:30,647 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:30,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -443758814, now seen corresponding path program 1 times
[2021-12-22 13:31:30,647 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:30,647 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023158897]
[2021-12-22 13:31:30,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:30,648 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:30,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:30,747 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-22 13:31:30,747 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:30,747 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023158897]
[2021-12-22 13:31:30,747 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023158897] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:30,747 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:30,747 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:30,747 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284143374]
[2021-12-22 13:31:30,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:30,748 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:30,748 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:30,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:30,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:30,749 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114
[2021-12-22 13:31:30,749 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 97 transitions, 239 flow. Second operand  has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 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-22 13:31:30,750 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:30,750 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114
[2021-12-22 13:31:30,750 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:31,155 INFO  L129       PetriNetUnfolder]: 621/1294 cut-off events.
[2021-12-22 13:31:31,155 INFO  L130       PetriNetUnfolder]: For 984/994 co-relation queries the response was YES.
[2021-12-22 13:31:31,159 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3000 conditions, 1294 events. 621/1294 cut-off events. For 984/994 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7546 event pairs, 162 based on Foata normal form. 40/1274 useless extension candidates. Maximal degree in co-relation 2942. Up to 463 conditions per place. 
[2021-12-22 13:31:31,163 INFO  L132   encePairwiseOnDemand]: 108/114 looper letters, 19 selfloop transitions, 2 changer transitions 34/135 dead transitions.
[2021-12-22 13:31:31,163 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 443 flow
[2021-12-22 13:31:31,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:31,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:31,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 885 transitions.
[2021-12-22 13:31:31,165 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8625730994152047
[2021-12-22 13:31:31,166 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 885 transitions.
[2021-12-22 13:31:31,166 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 885 transitions.
[2021-12-22 13:31:31,166 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:31,166 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 885 transitions.
[2021-12-22 13:31:31,168 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 98.33333333333333) internal successors, (885), 9 states have internal predecessors, (885), 0 states have call successors, (0), 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-22 13:31:31,169 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:31,170 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:31,170 INFO  L186             Difference]: Start difference. First operand has 129 places, 97 transitions, 239 flow. Second operand 9 states and 885 transitions.
[2021-12-22 13:31:31,170 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 443 flow
[2021-12-22 13:31:31,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 135 transitions, 426 flow, removed 7 selfloop flow, removed 4 redundant places.
[2021-12-22 13:31:31,176 INFO  L242             Difference]: Finished difference. Result has 122 places, 97 transitions, 250 flow
[2021-12-22 13:31:31,176 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=250, PETRI_PLACES=122, PETRI_TRANSITIONS=97}
[2021-12-22 13:31:31,177 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places.
[2021-12-22 13:31:31,177 INFO  L470      AbstractCegarLoop]: Abstraction has has 122 places, 97 transitions, 250 flow
[2021-12-22 13:31:31,177 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 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-22 13:31:31,178 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:31,178 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]
[2021-12-22 13:31:31,178 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-12-22 13:31:31,178 INFO  L402      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:31,178 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:31,179 INFO  L85        PathProgramCache]: Analyzing trace with hash -829095977, now seen corresponding path program 1 times
[2021-12-22 13:31:31,179 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:31,179 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895895383]
[2021-12-22 13:31:31,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:31,179 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:31,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:31,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-22 13:31:31,335 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:31,336 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895895383]
[2021-12-22 13:31:31,336 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895895383] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:31,336 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:31,336 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-12-22 13:31:31,336 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791730159]
[2021-12-22 13:31:31,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:31,337 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-12-22 13:31:31,338 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:31,339 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-12-22 13:31:31,341 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2021-12-22 13:31:31,342 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-22 13:31:31,343 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 97 transitions, 250 flow. Second operand  has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 13:31:31,343 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:31,343 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-22 13:31:31,343 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:31,789 INFO  L129       PetriNetUnfolder]: 955/1937 cut-off events.
[2021-12-22 13:31:31,789 INFO  L130       PetriNetUnfolder]: For 1995/2007 co-relation queries the response was YES.
[2021-12-22 13:31:31,796 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 4671 conditions, 1937 events. 955/1937 cut-off events. For 1995/2007 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11638 event pairs, 193 based on Foata normal form. 42/1867 useless extension candidates. Maximal degree in co-relation 4605. Up to 713 conditions per place. 
[2021-12-22 13:31:31,802 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 25 selfloop transitions, 12 changer transitions 29/142 dead transitions.
[2021-12-22 13:31:31,802 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 142 transitions, 502 flow
[2021-12-22 13:31:31,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:31,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:31,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions.
[2021-12-22 13:31:31,805 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8372319688109162
[2021-12-22 13:31:31,805 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 859 transitions.
[2021-12-22 13:31:31,805 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions.
[2021-12-22 13:31:31,805 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:31,805 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions.
[2021-12-22 13:31:31,807 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 13:31:31,808 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:31,808 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:31,808 INFO  L186             Difference]: Start difference. First operand has 122 places, 97 transitions, 250 flow. Second operand 9 states and 859 transitions.
[2021-12-22 13:31:31,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 142 transitions, 502 flow
[2021-12-22 13:31:31,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 142 transitions, 474 flow, removed 10 selfloop flow, removed 8 redundant places.
[2021-12-22 13:31:31,818 INFO  L242             Difference]: Finished difference. Result has 122 places, 104 transitions, 316 flow
[2021-12-22 13:31:31,818 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=104}
[2021-12-22 13:31:31,819 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places.
[2021-12-22 13:31:31,819 INFO  L470      AbstractCegarLoop]: Abstraction has has 122 places, 104 transitions, 316 flow
[2021-12-22 13:31:31,820 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 13:31:31,820 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:31,820 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]
[2021-12-22 13:31:31,820 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-12-22 13:31:31,820 INFO  L402      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:31,820 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:31,820 INFO  L85        PathProgramCache]: Analyzing trace with hash 51862913, now seen corresponding path program 2 times
[2021-12-22 13:31:31,821 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:31,822 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304378840]
[2021-12-22 13:31:31,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:31,822 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:31,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:32,087 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-22 13:31:32,087 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:32,087 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304378840]
[2021-12-22 13:31:32,087 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304378840] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:32,087 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:32,087 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-12-22 13:31:32,087 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064601035]
[2021-12-22 13:31:32,088 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:32,088 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-22 13:31:32,088 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:32,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-22 13:31:32,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2021-12-22 13:31:32,089 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114
[2021-12-22 13:31:32,090 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 104 transitions, 316 flow. Second operand  has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 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-22 13:31:32,090 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:32,090 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114
[2021-12-22 13:31:32,090 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:32,724 INFO  L129       PetriNetUnfolder]: 902/1809 cut-off events.
[2021-12-22 13:31:32,724 INFO  L130       PetriNetUnfolder]: For 2643/2877 co-relation queries the response was YES.
[2021-12-22 13:31:32,731 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5293 conditions, 1809 events. 902/1809 cut-off events. For 2643/2877 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10496 event pairs, 196 based on Foata normal form. 52/1785 useless extension candidates. Maximal degree in co-relation 5221. Up to 649 conditions per place. 
[2021-12-22 13:31:32,737 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 27 selfloop transitions, 16 changer transitions 61/179 dead transitions.
[2021-12-22 13:31:32,738 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 179 transitions, 864 flow
[2021-12-22 13:31:32,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2021-12-22 13:31:32,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2021-12-22 13:31:32,740 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1494 transitions.
[2021-12-22 13:31:32,741 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.819078947368421
[2021-12-22 13:31:32,741 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1494 transitions.
[2021-12-22 13:31:32,741 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1494 transitions.
[2021-12-22 13:31:32,742 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:32,742 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1494 transitions.
[2021-12-22 13:31:32,744 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 93.375) internal successors, (1494), 16 states have internal predecessors, (1494), 0 states have call successors, (0), 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-22 13:31:32,746 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 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-22 13:31:32,747 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 114.0) internal successors, (1938), 17 states have internal predecessors, (1938), 0 states have call successors, (0), 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-22 13:31:32,747 INFO  L186             Difference]: Start difference. First operand has 122 places, 104 transitions, 316 flow. Second operand 16 states and 1494 transitions.
[2021-12-22 13:31:32,747 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 179 transitions, 864 flow
[2021-12-22 13:31:32,751 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 179 transitions, 821 flow, removed 13 selfloop flow, removed 6 redundant places.
[2021-12-22 13:31:32,753 INFO  L242             Difference]: Finished difference. Result has 140 places, 109 transitions, 455 flow
[2021-12-22 13:31:32,753 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=455, PETRI_PLACES=140, PETRI_TRANSITIONS=109}
[2021-12-22 13:31:32,753 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places.
[2021-12-22 13:31:32,753 INFO  L470      AbstractCegarLoop]: Abstraction has has 140 places, 109 transitions, 455 flow
[2021-12-22 13:31:32,754 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 88.45454545454545) internal successors, (973), 11 states have internal predecessors, (973), 0 states have call successors, (0), 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-22 13:31:32,754 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:32,754 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]
[2021-12-22 13:31:32,754 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-12-22 13:31:32,754 INFO  L402      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:32,754 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:32,754 INFO  L85        PathProgramCache]: Analyzing trace with hash -2067756860, now seen corresponding path program 1 times
[2021-12-22 13:31:32,755 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:32,755 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138810396]
[2021-12-22 13:31:32,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:32,755 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:32,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:32,898 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-22 13:31:32,898 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:32,898 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138810396]
[2021-12-22 13:31:32,899 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138810396] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:32,899 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:32,899 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:32,899 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626897587]
[2021-12-22 13:31:32,899 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:32,899 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:32,900 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:32,900 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:32,900 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:32,901 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 114
[2021-12-22 13:31:32,901 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 109 transitions, 455 flow. Second operand  has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-22 13:31:32,901 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:32,902 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 114
[2021-12-22 13:31:32,902 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:33,395 INFO  L129       PetriNetUnfolder]: 1034/2120 cut-off events.
[2021-12-22 13:31:33,396 INFO  L130       PetriNetUnfolder]: For 16801/18899 co-relation queries the response was YES.
[2021-12-22 13:31:33,405 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 10896 conditions, 2120 events. 1034/2120 cut-off events. For 16801/18899 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13163 event pairs, 324 based on Foata normal form. 46/2081 useless extension candidates. Maximal degree in co-relation 10815. Up to 815 conditions per place. 
[2021-12-22 13:31:33,416 INFO  L132   encePairwiseOnDemand]: 108/114 looper letters, 43 selfloop transitions, 3 changer transitions 34/160 dead transitions.
[2021-12-22 13:31:33,416 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 160 transitions, 1113 flow
[2021-12-22 13:31:33,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:33,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:33,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 878 transitions.
[2021-12-22 13:31:33,418 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8557504873294347
[2021-12-22 13:31:33,418 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 878 transitions.
[2021-12-22 13:31:33,418 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 878 transitions.
[2021-12-22 13:31:33,419 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:33,419 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 878 transitions.
[2021-12-22 13:31:33,420 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 97.55555555555556) internal successors, (878), 9 states have internal predecessors, (878), 0 states have call successors, (0), 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-22 13:31:33,421 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:33,421 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:33,421 INFO  L186             Difference]: Start difference. First operand has 140 places, 109 transitions, 455 flow. Second operand 9 states and 878 transitions.
[2021-12-22 13:31:33,422 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 160 transitions, 1113 flow
[2021-12-22 13:31:33,430 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 1056 flow, removed 17 selfloop flow, removed 7 redundant places.
[2021-12-22 13:31:33,432 INFO  L242             Difference]: Finished difference. Result has 139 places, 109 transitions, 449 flow
[2021-12-22 13:31:33,432 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=449, PETRI_PLACES=139, PETRI_TRANSITIONS=109}
[2021-12-22 13:31:33,432 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 20 predicate places.
[2021-12-22 13:31:33,432 INFO  L470      AbstractCegarLoop]: Abstraction has has 139 places, 109 transitions, 449 flow
[2021-12-22 13:31:33,433 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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-22 13:31:33,433 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:33,433 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]
[2021-12-22 13:31:33,433 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-12-22 13:31:33,433 INFO  L402      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:33,433 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:33,433 INFO  L85        PathProgramCache]: Analyzing trace with hash 664608634, now seen corresponding path program 1 times
[2021-12-22 13:31:33,433 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:33,434 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460657324]
[2021-12-22 13:31:33,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:33,434 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:33,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:33,519 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-22 13:31:33,519 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:33,519 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460657324]
[2021-12-22 13:31:33,519 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460657324] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:33,519 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:33,519 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:33,519 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570354614]
[2021-12-22 13:31:33,523 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:33,523 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:33,523 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:33,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:33,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:33,524 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114
[2021-12-22 13:31:33,524 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 109 transitions, 449 flow. Second operand  has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 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-22 13:31:33,524 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:33,524 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114
[2021-12-22 13:31:33,524 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:33,870 INFO  L129       PetriNetUnfolder]: 729/1581 cut-off events.
[2021-12-22 13:31:33,870 INFO  L130       PetriNetUnfolder]: For 13951/15016 co-relation queries the response was YES.
[2021-12-22 13:31:33,876 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 1581 events. 729/1581 cut-off events. For 13951/15016 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9746 event pairs, 200 based on Foata normal form. 60/1544 useless extension candidates. Maximal degree in co-relation 8270. Up to 605 conditions per place. 
[2021-12-22 13:31:33,883 INFO  L132   encePairwiseOnDemand]: 108/114 looper letters, 27 selfloop transitions, 2 changer transitions 31/144 dead transitions.
[2021-12-22 13:31:33,883 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 144 transitions, 917 flow
[2021-12-22 13:31:33,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:33,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:33,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 882 transitions.
[2021-12-22 13:31:33,886 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8596491228070176
[2021-12-22 13:31:33,886 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 882 transitions.
[2021-12-22 13:31:33,886 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 882 transitions.
[2021-12-22 13:31:33,886 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:33,886 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 882 transitions.
[2021-12-22 13:31:33,887 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 98.0) internal successors, (882), 9 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 13:31:33,889 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:33,889 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:33,889 INFO  L186             Difference]: Start difference. First operand has 139 places, 109 transitions, 449 flow. Second operand 9 states and 882 transitions.
[2021-12-22 13:31:33,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 144 transitions, 917 flow
[2021-12-22 13:31:33,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 144 transitions, 880 flow, removed 17 selfloop flow, removed 7 redundant places.
[2021-12-22 13:31:33,899 INFO  L242             Difference]: Finished difference. Result has 141 places, 109 transitions, 448 flow
[2021-12-22 13:31:33,899 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=141, PETRI_TRANSITIONS=109}
[2021-12-22 13:31:33,900 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places.
[2021-12-22 13:31:33,900 INFO  L470      AbstractCegarLoop]: Abstraction has has 141 places, 109 transitions, 448 flow
[2021-12-22 13:31:33,900 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 0 states have call successors, (0), 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-22 13:31:33,900 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:33,900 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]
[2021-12-22 13:31:33,901 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-12-22 13:31:33,901 INFO  L402      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:33,901 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:33,901 INFO  L85        PathProgramCache]: Analyzing trace with hash -527848886, now seen corresponding path program 1 times
[2021-12-22 13:31:33,901 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:33,901 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268323818]
[2021-12-22 13:31:33,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:33,902 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:33,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:34,129 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-22 13:31:34,129 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:34,129 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268323818]
[2021-12-22 13:31:34,129 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268323818] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:34,129 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:34,129 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-12-22 13:31:34,130 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197283484]
[2021-12-22 13:31:34,130 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:34,130 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-12-22 13:31:34,130 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:34,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-12-22 13:31:34,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2021-12-22 13:31:34,131 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-22 13:31:34,132 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 109 transitions, 448 flow. Second operand  has 12 states, 12 states have (on average 86.66666666666667) internal successors, (1040), 12 states have internal predecessors, (1040), 0 states have call successors, (0), 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-22 13:31:34,132 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:34,132 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-22 13:31:34,132 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:34,701 INFO  L129       PetriNetUnfolder]: 687/1617 cut-off events.
[2021-12-22 13:31:34,701 INFO  L130       PetriNetUnfolder]: For 14411/17422 co-relation queries the response was YES.
[2021-12-22 13:31:34,707 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 8383 conditions, 1617 events. 687/1617 cut-off events. For 14411/17422 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10661 event pairs, 116 based on Foata normal form. 57/1548 useless extension candidates. Maximal degree in co-relation 8294. Up to 577 conditions per place. 
[2021-12-22 13:31:34,713 INFO  L132   encePairwiseOnDemand]: 100/114 looper letters, 41 selfloop transitions, 15 changer transitions 54/183 dead transitions.
[2021-12-22 13:31:34,713 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 183 transitions, 1544 flow
[2021-12-22 13:31:34,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2021-12-22 13:31:34,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2021-12-22 13:31:34,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1888 transitions.
[2021-12-22 13:31:34,723 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7886382623224728
[2021-12-22 13:31:34,723 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1888 transitions.
[2021-12-22 13:31:34,723 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1888 transitions.
[2021-12-22 13:31:34,724 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:34,724 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1888 transitions.
[2021-12-22 13:31:34,727 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 89.9047619047619) internal successors, (1888), 21 states have internal predecessors, (1888), 0 states have call successors, (0), 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-22 13:31:34,730 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 0 states have call successors, (0), 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-22 13:31:34,730 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 114.0) internal successors, (2508), 22 states have internal predecessors, (2508), 0 states have call successors, (0), 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-22 13:31:34,730 INFO  L186             Difference]: Start difference. First operand has 141 places, 109 transitions, 448 flow. Second operand 21 states and 1888 transitions.
[2021-12-22 13:31:34,730 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 183 transitions, 1544 flow
[2021-12-22 13:31:34,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 183 transitions, 1482 flow, removed 28 selfloop flow, removed 8 redundant places.
[2021-12-22 13:31:34,740 INFO  L242             Difference]: Finished difference. Result has 161 places, 115 transitions, 579 flow
[2021-12-22 13:31:34,741 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=579, PETRI_PLACES=161, PETRI_TRANSITIONS=115}
[2021-12-22 13:31:34,741 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 42 predicate places.
[2021-12-22 13:31:34,741 INFO  L470      AbstractCegarLoop]: Abstraction has has 161 places, 115 transitions, 579 flow
[2021-12-22 13:31:34,742 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 86.66666666666667) internal successors, (1040), 12 states have internal predecessors, (1040), 0 states have call successors, (0), 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-22 13:31:34,742 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:34,742 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]
[2021-12-22 13:31:34,742 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-12-22 13:31:34,742 INFO  L402      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:34,742 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:34,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 2673238, now seen corresponding path program 1 times
[2021-12-22 13:31:34,743 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:34,743 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710223572]
[2021-12-22 13:31:34,743 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:34,743 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:34,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:35,020 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-22 13:31:35,020 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:35,020 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710223572]
[2021-12-22 13:31:35,021 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710223572] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:35,021 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:35,021 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-12-22 13:31:35,021 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425788174]
[2021-12-22 13:31:35,021 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:35,021 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-12-22 13:31:35,021 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:35,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-12-22 13:31:35,021 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210
[2021-12-22 13:31:35,022 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 114
[2021-12-22 13:31:35,023 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 115 transitions, 579 flow. Second operand  has 15 states, 15 states have (on average 85.46666666666667) internal successors, (1282), 15 states have internal predecessors, (1282), 0 states have call successors, (0), 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-22 13:31:35,023 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:35,023 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 114
[2021-12-22 13:31:35,023 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:35,630 INFO  L129       PetriNetUnfolder]: 428/1347 cut-off events.
[2021-12-22 13:31:35,630 INFO  L130       PetriNetUnfolder]: For 12379/14257 co-relation queries the response was YES.
[2021-12-22 13:31:35,637 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6638 conditions, 1347 events. 428/1347 cut-off events. For 12379/14257 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10069 event pairs, 68 based on Foata normal form. 38/1311 useless extension candidates. Maximal degree in co-relation 6536. Up to 430 conditions per place. 
[2021-12-22 13:31:35,641 INFO  L132   encePairwiseOnDemand]: 101/114 looper letters, 33 selfloop transitions, 14 changer transitions 43/162 dead transitions.
[2021-12-22 13:31:35,641 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 162 transitions, 1374 flow
[2021-12-22 13:31:35,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2021-12-22 13:31:35,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2021-12-22 13:31:35,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1673 transitions.
[2021-12-22 13:31:35,645 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7723915050784856
[2021-12-22 13:31:35,645 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1673 transitions.
[2021-12-22 13:31:35,645 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1673 transitions.
[2021-12-22 13:31:35,646 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:35,646 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1673 transitions.
[2021-12-22 13:31:35,649 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 88.05263157894737) internal successors, (1673), 19 states have internal predecessors, (1673), 0 states have call successors, (0), 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-22 13:31:35,651 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 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-22 13:31:35,652 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 0 states have call successors, (0), 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-22 13:31:35,652 INFO  L186             Difference]: Start difference. First operand has 161 places, 115 transitions, 579 flow. Second operand 19 states and 1673 transitions.
[2021-12-22 13:31:35,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 162 transitions, 1374 flow
[2021-12-22 13:31:35,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 162 transitions, 1233 flow, removed 67 selfloop flow, removed 16 redundant places.
[2021-12-22 13:31:35,667 INFO  L242             Difference]: Finished difference. Result has 163 places, 109 transitions, 551 flow
[2021-12-22 13:31:35,667 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=551, PETRI_PLACES=163, PETRI_TRANSITIONS=109}
[2021-12-22 13:31:35,667 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 44 predicate places.
[2021-12-22 13:31:35,668 INFO  L470      AbstractCegarLoop]: Abstraction has has 163 places, 109 transitions, 551 flow
[2021-12-22 13:31:35,668 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 85.46666666666667) internal successors, (1282), 15 states have internal predecessors, (1282), 0 states have call successors, (0), 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-22 13:31:35,668 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:35,668 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]
[2021-12-22 13:31:35,668 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-12-22 13:31:35,669 INFO  L402      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:35,669 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:35,669 INFO  L85        PathProgramCache]: Analyzing trace with hash 1533451342, now seen corresponding path program 1 times
[2021-12-22 13:31:35,669 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:35,669 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518570017]
[2021-12-22 13:31:35,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:35,670 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:35,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:35,784 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-22 13:31:35,784 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:35,784 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518570017]
[2021-12-22 13:31:35,784 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518570017] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:35,785 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:35,785 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-12-22 13:31:35,785 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002313806]
[2021-12-22 13:31:35,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:35,785 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2021-12-22 13:31:35,785 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:35,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-12-22 13:31:35,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2021-12-22 13:31:35,786 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114
[2021-12-22 13:31:35,787 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 109 transitions, 551 flow. Second operand  has 9 states, 9 states have (on average 89.11111111111111) internal successors, (802), 9 states have internal predecessors, (802), 0 states have call successors, (0), 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-22 13:31:35,787 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:35,787 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114
[2021-12-22 13:31:35,787 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:36,115 INFO  L129       PetriNetUnfolder]: 348/1272 cut-off events.
[2021-12-22 13:31:36,116 INFO  L130       PetriNetUnfolder]: For 8653/10003 co-relation queries the response was YES.
[2021-12-22 13:31:36,121 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 5942 conditions, 1272 events. 348/1272 cut-off events. For 8653/10003 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 10699 event pairs, 211 based on Foata normal form. 29/1244 useless extension candidates. Maximal degree in co-relation 5840. Up to 436 conditions per place. 
[2021-12-22 13:31:36,125 INFO  L132   encePairwiseOnDemand]: 103/114 looper letters, 29 selfloop transitions, 9 changer transitions 23/136 dead transitions.
[2021-12-22 13:31:36,126 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 136 transitions, 1079 flow
[2021-12-22 13:31:36,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-12-22 13:31:36,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2021-12-22 13:31:36,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 833 transitions.
[2021-12-22 13:31:36,129 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8118908382066277
[2021-12-22 13:31:36,129 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 833 transitions.
[2021-12-22 13:31:36,130 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 833 transitions.
[2021-12-22 13:31:36,130 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:36,130 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 833 transitions.
[2021-12-22 13:31:36,132 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 92.55555555555556) internal successors, (833), 9 states have internal predecessors, (833), 0 states have call successors, (0), 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-22 13:31:36,135 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:36,135 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 114.0) internal successors, (1140), 10 states have internal predecessors, (1140), 0 states have call successors, (0), 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-22 13:31:36,135 INFO  L186             Difference]: Start difference. First operand has 163 places, 109 transitions, 551 flow. Second operand 9 states and 833 transitions.
[2021-12-22 13:31:36,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 136 transitions, 1079 flow
[2021-12-22 13:31:36,152 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 136 transitions, 932 flow, removed 65 selfloop flow, removed 24 redundant places.
[2021-12-22 13:31:36,153 INFO  L242             Difference]: Finished difference. Result has 141 places, 108 transitions, 506 flow
[2021-12-22 13:31:36,154 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=141, PETRI_TRANSITIONS=108}
[2021-12-22 13:31:36,155 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places.
[2021-12-22 13:31:36,155 INFO  L470      AbstractCegarLoop]: Abstraction has has 141 places, 108 transitions, 506 flow
[2021-12-22 13:31:36,156 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 89.11111111111111) internal successors, (802), 9 states have internal predecessors, (802), 0 states have call successors, (0), 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-22 13:31:36,156 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:36,156 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]
[2021-12-22 13:31:36,156 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-12-22 13:31:36,156 INFO  L402      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:36,156 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:36,157 INFO  L85        PathProgramCache]: Analyzing trace with hash -480593004, now seen corresponding path program 2 times
[2021-12-22 13:31:36,157 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:36,158 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029855296]
[2021-12-22 13:31:36,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:36,159 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:36,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:36,345 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-22 13:31:36,345 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:36,346 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029855296]
[2021-12-22 13:31:36,346 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029855296] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:36,346 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:36,346 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-12-22 13:31:36,346 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003676528]
[2021-12-22 13:31:36,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:36,346 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2021-12-22 13:31:36,346 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:36,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-12-22 13:31:36,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-12-22 13:31:36,348 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 114
[2021-12-22 13:31:36,348 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 108 transitions, 506 flow. Second operand  has 12 states, 12 states have (on average 86.75) internal successors, (1041), 12 states have internal predecessors, (1041), 0 states have call successors, (0), 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-22 13:31:36,349 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:36,349 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 114
[2021-12-22 13:31:36,349 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:36,675 INFO  L129       PetriNetUnfolder]: 207/847 cut-off events.
[2021-12-22 13:31:36,675 INFO  L130       PetriNetUnfolder]: For 3858/4321 co-relation queries the response was YES.
[2021-12-22 13:31:36,679 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 847 events. 207/847 cut-off events. For 3858/4321 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6292 event pairs, 46 based on Foata normal form. 23/842 useless extension candidates. Maximal degree in co-relation 3291. Up to 255 conditions per place. 
[2021-12-22 13:31:36,681 INFO  L132   encePairwiseOnDemand]: 99/114 looper letters, 23 selfloop transitions, 12 changer transitions 27/135 dead transitions.
[2021-12-22 13:31:36,681 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 135 transitions, 958 flow
[2021-12-22 13:31:36,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-12-22 13:31:36,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2021-12-22 13:31:36,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1158 transitions.
[2021-12-22 13:31:36,683 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.7813765182186235
[2021-12-22 13:31:36,683 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1158 transitions.
[2021-12-22 13:31:36,683 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1158 transitions.
[2021-12-22 13:31:36,683 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:36,683 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1158 transitions.
[2021-12-22 13:31:36,685 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 89.07692307692308) internal successors, (1158), 13 states have internal predecessors, (1158), 0 states have call successors, (0), 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-22 13:31:36,687 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-22 13:31:36,688 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 0 states have call successors, (0), 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-22 13:31:36,688 INFO  L186             Difference]: Start difference. First operand has 141 places, 108 transitions, 506 flow. Second operand 13 states and 1158 transitions.
[2021-12-22 13:31:36,688 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 135 transitions, 958 flow
[2021-12-22 13:31:36,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 135 transitions, 917 flow, removed 7 selfloop flow, removed 9 redundant places.
[2021-12-22 13:31:36,694 INFO  L242             Difference]: Finished difference. Result has 145 places, 103 transitions, 418 flow
[2021-12-22 13:31:36,695 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=418, PETRI_PLACES=145, PETRI_TRANSITIONS=103}
[2021-12-22 13:31:36,695 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 26 predicate places.
[2021-12-22 13:31:36,695 INFO  L470      AbstractCegarLoop]: Abstraction has has 145 places, 103 transitions, 418 flow
[2021-12-22 13:31:36,696 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 86.75) internal successors, (1041), 12 states have internal predecessors, (1041), 0 states have call successors, (0), 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-22 13:31:36,696 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:36,696 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]
[2021-12-22 13:31:36,696 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-12-22 13:31:36,696 INFO  L402      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:36,696 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:36,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -379733339, now seen corresponding path program 1 times
[2021-12-22 13:31:36,697 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:36,697 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150071582]
[2021-12-22 13:31:36,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:36,697 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:36,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:36,795 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-22 13:31:36,795 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:36,795 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150071582]
[2021-12-22 13:31:36,795 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150071582] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:36,795 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:36,795 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 13:31:36,796 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749104586]
[2021-12-22 13:31:36,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:36,796 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 13:31:36,796 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:36,796 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 13:31:36,796 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-12-22 13:31:36,797 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-22 13:31:36,797 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 103 transitions, 418 flow. Second operand  has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 13:31:36,797 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:36,798 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-22 13:31:36,798 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:37,341 INFO  L129       PetriNetUnfolder]: 1848/3612 cut-off events.
[2021-12-22 13:31:37,342 INFO  L130       PetriNetUnfolder]: For 22332/22358 co-relation queries the response was YES.
[2021-12-22 13:31:37,354 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 13253 conditions, 3612 events. 1848/3612 cut-off events. For 22332/22358 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 25056 event pairs, 82 based on Foata normal form. 1/3534 useless extension candidates. Maximal degree in co-relation 13167. Up to 1056 conditions per place. 
[2021-12-22 13:31:37,363 INFO  L132   encePairwiseOnDemand]: 104/114 looper letters, 38 selfloop transitions, 6 changer transitions 62/181 dead transitions.
[2021-12-22 13:31:37,364 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 181 transitions, 1286 flow
[2021-12-22 13:31:37,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-22 13:31:37,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-22 13:31:37,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 972 transitions.
[2021-12-22 13:31:37,366 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8526315789473684
[2021-12-22 13:31:37,366 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 972 transitions.
[2021-12-22 13:31:37,366 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 972 transitions.
[2021-12-22 13:31:37,368 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:37,368 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 972 transitions.
[2021-12-22 13:31:37,369 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 0 states have call successors, (0), 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-22 13:31:37,370 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-22 13:31:37,371 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-22 13:31:37,371 INFO  L186             Difference]: Start difference. First operand has 145 places, 103 transitions, 418 flow. Second operand 10 states and 972 transitions.
[2021-12-22 13:31:37,371 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 181 transitions, 1286 flow
[2021-12-22 13:31:37,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 181 transitions, 1180 flow, removed 7 selfloop flow, removed 19 redundant places.
[2021-12-22 13:31:37,382 INFO  L242             Difference]: Finished difference. Result has 137 places, 101 transitions, 384 flow
[2021-12-22 13:31:37,382 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=384, PETRI_PLACES=137, PETRI_TRANSITIONS=101}
[2021-12-22 13:31:37,382 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places.
[2021-12-22 13:31:37,383 INFO  L470      AbstractCegarLoop]: Abstraction has has 137 places, 101 transitions, 384 flow
[2021-12-22 13:31:37,383 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 13:31:37,383 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:37,383 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]
[2021-12-22 13:31:37,383 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-12-22 13:31:37,383 INFO  L402      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:37,384 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:37,384 INFO  L85        PathProgramCache]: Analyzing trace with hash 1351515203, now seen corresponding path program 1 times
[2021-12-22 13:31:37,384 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:37,384 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496889312]
[2021-12-22 13:31:37,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:37,384 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:37,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:37,468 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-22 13:31:37,468 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:37,469 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496889312]
[2021-12-22 13:31:37,469 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496889312] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:37,469 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:37,469 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-12-22 13:31:37,469 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216392946]
[2021-12-22 13:31:37,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:37,469 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2021-12-22 13:31:37,469 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:37,470 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-12-22 13:31:37,470 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-12-22 13:31:37,470 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-22 13:31:37,471 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 101 transitions, 384 flow. Second operand  has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 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-22 13:31:37,471 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:37,471 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-22 13:31:37,471 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:37,834 INFO  L129       PetriNetUnfolder]: 624/1580 cut-off events.
[2021-12-22 13:31:37,834 INFO  L130       PetriNetUnfolder]: For 9243/9259 co-relation queries the response was YES.
[2021-12-22 13:31:37,839 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 6301 conditions, 1580 events. 624/1580 cut-off events. For 9243/9259 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 10625 event pairs, 27 based on Foata normal form. 66/1643 useless extension candidates. Maximal degree in co-relation 6225. Up to 394 conditions per place. 
[2021-12-22 13:31:37,842 INFO  L132   encePairwiseOnDemand]: 105/114 looper letters, 39 selfloop transitions, 9 changer transitions 46/169 dead transitions.
[2021-12-22 13:31:37,842 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 169 transitions, 1225 flow
[2021-12-22 13:31:37,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-12-22 13:31:37,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2021-12-22 13:31:37,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 964 transitions.
[2021-12-22 13:31:37,844 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8456140350877193
[2021-12-22 13:31:37,844 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 964 transitions.
[2021-12-22 13:31:37,844 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 964 transitions.
[2021-12-22 13:31:37,845 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:37,845 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 964 transitions.
[2021-12-22 13:31:37,846 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 96.4) internal successors, (964), 10 states have internal predecessors, (964), 0 states have call successors, (0), 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-22 13:31:37,847 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-22 13:31:37,848 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 0 states have call successors, (0), 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-22 13:31:37,848 INFO  L186             Difference]: Start difference. First operand has 137 places, 101 transitions, 384 flow. Second operand 10 states and 964 transitions.
[2021-12-22 13:31:37,848 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 169 transitions, 1225 flow
[2021-12-22 13:31:37,855 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 169 transitions, 1201 flow, removed 7 selfloop flow, removed 5 redundant places.
[2021-12-22 13:31:37,857 INFO  L242             Difference]: Finished difference. Result has 141 places, 104 transitions, 452 flow
[2021-12-22 13:31:37,857 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=452, PETRI_PLACES=141, PETRI_TRANSITIONS=104}
[2021-12-22 13:31:37,858 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 22 predicate places.
[2021-12-22 13:31:37,858 INFO  L470      AbstractCegarLoop]: Abstraction has has 141 places, 104 transitions, 452 flow
[2021-12-22 13:31:37,858 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 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-22 13:31:37,858 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:37,858 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]
[2021-12-22 13:31:37,858 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-12-22 13:31:37,859 INFO  L402      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:37,859 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:37,859 INFO  L85        PathProgramCache]: Analyzing trace with hash 1314987780, now seen corresponding path program 1 times
[2021-12-22 13:31:37,859 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:37,859 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254816164]
[2021-12-22 13:31:37,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:37,860 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:37,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 13:31:37,951 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-22 13:31:37,951 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-12-22 13:31:37,951 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254816164]
[2021-12-22 13:31:37,951 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254816164] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 13:31:37,951 INFO  L186   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 13:31:37,951 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-12-22 13:31:37,952 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667421467]
[2021-12-22 13:31:37,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 13:31:37,952 INFO  L546      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2021-12-22 13:31:37,952 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-12-22 13:31:37,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-12-22 13:31:37,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-12-22 13:31:37,953 INFO  L499   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 114
[2021-12-22 13:31:37,953 INFO  L92    encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 104 transitions, 452 flow. Second operand  has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 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-22 13:31:37,954 INFO  L101   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2021-12-22 13:31:37,954 INFO  L102   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 114
[2021-12-22 13:31:37,954 INFO  L74            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2021-12-22 13:31:38,203 INFO  L129       PetriNetUnfolder]: 194/675 cut-off events.
[2021-12-22 13:31:38,203 INFO  L130       PetriNetUnfolder]: For 3786/3786 co-relation queries the response was YES.
[2021-12-22 13:31:38,206 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 2713 conditions, 675 events. 194/675 cut-off events. For 3786/3786 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3962 event pairs, 27 based on Foata normal form. 20/692 useless extension candidates. Maximal degree in co-relation 2652. Up to 147 conditions per place. 
[2021-12-22 13:31:38,207 INFO  L132   encePairwiseOnDemand]: 105/114 looper letters, 29 selfloop transitions, 12 changer transitions 25/141 dead transitions.
[2021-12-22 13:31:38,207 INFO  L138   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 141 transitions, 969 flow
[2021-12-22 13:31:38,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-12-22 13:31:38,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2021-12-22 13:31:38,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1029 transitions.
[2021-12-22 13:31:38,217 INFO  L544   CegarLoopForPetriNet]: DFA transition density 0.8205741626794258
[2021-12-22 13:31:38,217 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1029 transitions.
[2021-12-22 13:31:38,217 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1029 transitions.
[2021-12-22 13:31:38,217 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-12-22 13:31:38,218 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1029 transitions.
[2021-12-22 13:31:38,219 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 93.54545454545455) internal successors, (1029), 11 states have internal predecessors, (1029), 0 states have call successors, (0), 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-22 13:31:38,220 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-22 13:31:38,221 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 0 states have call successors, (0), 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-22 13:31:38,221 INFO  L186             Difference]: Start difference. First operand has 141 places, 104 transitions, 452 flow. Second operand 11 states and 1029 transitions.
[2021-12-22 13:31:38,221 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 141 transitions, 969 flow
[2021-12-22 13:31:38,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 141 transitions, 822 flow, removed 53 selfloop flow, removed 13 redundant places.
[2021-12-22 13:31:38,228 INFO  L242             Difference]: Finished difference. Result has 140 places, 104 transitions, 411 flow
[2021-12-22 13:31:38,228 INFO  L317   CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=411, PETRI_PLACES=140, PETRI_TRANSITIONS=104}
[2021-12-22 13:31:38,229 INFO  L334   CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places.
[2021-12-22 13:31:38,229 INFO  L470      AbstractCegarLoop]: Abstraction has has 140 places, 104 transitions, 411 flow
[2021-12-22 13:31:38,230 INFO  L471      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 90.375) internal successors, (723), 8 states have internal predecessors, (723), 0 states have call successors, (0), 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-22 13:31:38,230 INFO  L246   CegarLoopForPetriNet]: Found error trace
[2021-12-22 13:31:38,230 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]
[2021-12-22 13:31:38,230 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-12-22 13:31:38,230 INFO  L402      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] ===
[2021-12-22 13:31:38,230 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 13:31:38,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 2034157713, now seen corresponding path program 1 times
[2021-12-22 13:31:38,231 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-12-22 13:31:38,231 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702058791]
[2021-12-22 13:31:38,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 13:31:38,231 INFO  L126          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-12-22 13:31:38,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 13:31:38,280 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-12-22 13:31:38,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-12-22 13:31:38,377 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-12-22 13:31:38,377 INFO  L628         BasicCegarLoop]: Counterexample is feasible
[2021-12-22 13:31:38,378 INFO  L764   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2021-12-22 13:31:38,380 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2021-12-22 13:31:38,381 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining)
[2021-12-22 13:31:38,381 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining)
[2021-12-22 13:31:38,381 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining)
[2021-12-22 13:31:38,381 INFO  L764   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2021-12-22 13:31:38,382 WARN  L452      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-12-22 13:31:38,384 INFO  L732         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 13:31:38,389 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-12-22 13:31:38,389 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2021-12-22 13:31:38,508 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:31:38 BasicIcfg
[2021-12-22 13:31:38,509 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-12-22 13:31:38,509 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-12-22 13:31:38,509 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-12-22 13:31:38,509 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-12-22 13:31:38,510 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:31:29" (3/4) ...
[2021-12-22 13:31:38,511 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-12-22 13:31:38,615 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2021-12-22 13:31:38,616 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-12-22 13:31:38,616 INFO  L158              Benchmark]: Toolchain (without parser) took 11317.61ms. Allocated memory was 104.9MB in the beginning and 633.3MB in the end (delta: 528.5MB). Free memory was 74.8MB in the beginning and 562.1MB in the end (delta: -487.2MB). Peak memory consumption was 336.7MB. Max. memory is 16.1GB.
[2021-12-22 13:31:38,616 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2021-12-22 13:31:38,617 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 411.20ms. Allocated memory is still 104.9MB. Free memory was 74.6MB in the beginning and 64.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2021-12-22 13:31:38,617 INFO  L158              Benchmark]: Boogie Procedure Inliner took 74.52ms. Allocated memory is still 104.9MB. Free memory was 64.2MB in the beginning and 61.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2021-12-22 13:31:38,617 INFO  L158              Benchmark]: Boogie Preprocessor took 77.04ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 58.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2021-12-22 13:31:38,617 INFO  L158              Benchmark]: RCFGBuilder took 1183.51ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 58.2MB in the beginning and 49.8MB in the end (delta: 8.3MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB.
[2021-12-22 13:31:38,618 INFO  L158              Benchmark]: TraceAbstraction took 9457.03ms. Allocated memory was 130.0MB in the beginning and 526.4MB in the end (delta: 396.4MB). Free memory was 49.8MB in the beginning and 186.5MB in the end (delta: -136.7MB). Peak memory consumption was 260.6MB. Max. memory is 16.1GB.
[2021-12-22 13:31:38,618 INFO  L158              Benchmark]: Witness Printer took 106.58ms. Allocated memory was 526.4MB in the beginning and 633.3MB in the end (delta: 107.0MB). Free memory was 186.5MB in the beginning and 562.1MB in the end (delta: -375.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB.
[2021-12-22 13:31:38,619 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 411.20ms. Allocated memory is still 104.9MB. Free memory was 74.6MB in the beginning and 64.2MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 74.52ms. Allocated memory is still 104.9MB. Free memory was 64.2MB in the beginning and 61.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 77.04ms. Allocated memory is still 104.9MB. Free memory was 61.1MB in the beginning and 58.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1183.51ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 58.2MB in the beginning and 49.8MB in the end (delta: 8.3MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB.
 * TraceAbstraction took 9457.03ms. Allocated memory was 130.0MB in the beginning and 526.4MB in the end (delta: 396.4MB). Free memory was 49.8MB in the beginning and 186.5MB in the end (delta: -136.7MB). Peak memory consumption was 260.6MB. Max. memory is 16.1GB.
 * Witness Printer took 106.58ms. Allocated memory was 526.4MB in the beginning and 633.3MB in the end (delta: 107.0MB). Free memory was 186.5MB in the beginning and 562.1MB in the end (delta: -375.6MB). Peak memory consumption was 27.3MB. 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: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L711]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0]
[L713]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L714]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L715]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L717]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L719]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L720]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0]
[L721]               0  int y$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0]
[L722]               0  _Bool y$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0]
[L723]               0  _Bool y$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0]
[L724]               0  _Bool y$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0]
[L725]               0  _Bool y$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0]
[L726]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0]
[L727]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L728]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L729]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L730]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0]
[L731]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L732]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L733]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L734]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L735]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L736]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L737]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L844]               0  pthread_t t1873;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L845]  FCALL, FORK  0  pthread_create(&t1873, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1873, ((void *)0), P0, ((void *)0))=-2, t1873={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L846]               0  pthread_t t1874;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L847]  FCALL, FORK  0  pthread_create(&t1874, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1874, ((void *)0), P1, ((void *)0))=-1, t1873={5:0}, t1874={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L848]               0  pthread_t t1875;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L849]  FCALL, FORK  0  pthread_create(&t1875, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1875, ((void *)0), P2, ((void *)0))=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L741]               1  y$w_buff1 = y$w_buff0
[L742]               1  y$w_buff0 = 2
[L743]               1  y$w_buff1_used = y$w_buff0_used
[L744]               1  y$w_buff0_used = (_Bool)1
[L745]  CALL         1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L745]  RET          1  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L746]               1  y$r_buff1_thd0 = y$r_buff0_thd0
[L747]               1  y$r_buff1_thd1 = y$r_buff0_thd1
[L748]               1  y$r_buff1_thd2 = y$r_buff0_thd2
[L749]               1  y$r_buff1_thd3 = y$r_buff0_thd3
[L750]               1  y$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L753]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L770]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  y$flush_delayed = weak$$choice2
[L793]               3  y$mem_tmp = y
[L794]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L794]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L795]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L795]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L795]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L795]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L796]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L796]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L796]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L796]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L797]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L797]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L797]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L797]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L798]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L798]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L798]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L798]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L799]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L799]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L799]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L800]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L800]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L800]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EAX = y
[L802]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L802]               3  y = y$flush_delayed ? y$mem_tmp : y
[L803]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L806]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L807]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L808]               3  y$flush_delayed = weak$$choice2
[L809]               3  y$mem_tmp = y
[L810]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L810]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L811]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L811]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)
[L811]  EXPR         3  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L811]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L812]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L812]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)
[L812]  EXPR         3  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L812]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L813]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L813]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)
[L813]  EXPR         3  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L813]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L814]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L814]  EXPR         3  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L815]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)
[L815]  EXPR         3  weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L815]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L816]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]  EXPR         3  !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L816]  EXPR         3  weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  __unbuffered_p2_EBX = y
[L818]  EXPR         3  y$flush_delayed ? y$mem_tmp : y
[L818]               3  y = y$flush_delayed ? y$mem_tmp : y
[L819]               3  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0]
[L776]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L776]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L776]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L776]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L777]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L777]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L778]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L778]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L779]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L779]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L780]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L780]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L756]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L756]               1  y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L757]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L757]               1  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L758]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L758]               1  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L759]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L759]               1  y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L760]  EXPR         1  y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L760]               1  y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
[L822]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L822]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L822]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L822]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L823]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L823]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L824]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L824]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L825]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L825]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L826]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L826]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L783]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L829]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L851]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L853]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L853]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L855]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L855]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L855]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L855]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L856]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L856]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L857]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L858]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L859]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L859]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L862]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L863]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L864]               0  y$flush_delayed = weak$$choice2
[L865]               0  y$mem_tmp = y
[L866]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L866]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L867]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L867]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)
[L867]  EXPR         0  weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L867]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L868]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L868]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)
[L868]  EXPR         0  weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L868]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L869]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L869]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)
[L869]  EXPR         0  weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L869]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L870]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L870]  EXPR         0  weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L870]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L871]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L871]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)
[L871]  EXPR         0  weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L871]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L872]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L872]  EXPR         0  weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L872]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L874]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L874]               0  y = y$flush_delayed ? y$mem_tmp : y
[L875]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873={5:0}, t1874={6:0}, t1875={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L877]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L18]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]

  - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable
    Unable to prove that call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 845]: 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: 849]: 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: 847]: 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, 141 locations, 6 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: 9.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 849 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 849 mSDsluCounter, 565 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1135 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1906 IncrementalHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 122 mSDtfsCounter, 1906 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=579occurred in iteration=8, InterpolantAutomatonStates: 157, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 5879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2021-12-22 13:31:38,653 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