/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i


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


This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m
[2023-11-10 11:41:47,595 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-10 11:41:47,639 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf
[2023-11-10 11:41:47,660 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-10 11:41:47,661 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-10 11:41:47,661 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-10 11:41:47,662 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-10 11:41:47,662 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-10 11:41:47,662 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-10 11:41:47,663 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-10 11:41:47,663 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-10 11:41:47,663 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-10 11:41:47,664 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-10 11:41:47,664 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-10 11:41:47,664 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-10 11:41:47,665 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-10 11:41:47,665 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-10 11:41:47,665 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-10 11:41:47,666 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-10 11:41:47,666 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-10 11:41:47,666 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-10 11:41:47,667 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-10 11:41:47,667 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-10 11:41:47,668 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-11-10 11:41:47,668 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-10 11:41:47,668 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-10 11:41:47,669 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-10 11:41:47,669 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-10 11:41:47,669 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-10 11:41:47,670 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-10 11:41:47,670 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-10 11:41:47,670 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-10 11:41:47,671 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-10 11:41:47,671 INFO  L153        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
[2023-11-10 11:41:47,851 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-10 11:41:47,872 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-10 11:41:47,877 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-10 11:41:47,878 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-10 11:41:47,880 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-10 11:41:47,881 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i
[2023-11-10 11:41:48,957 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-10 11:41:49,203 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-10 11:41:49,203 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i
[2023-11-10 11:41:49,218 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7060134d0/96de5b90de1f47d3a642521ef9dc8cf1/FLAGa2b266c09
[2023-11-10 11:41:49,229 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7060134d0/96de5b90de1f47d3a642521ef9dc8cf1
[2023-11-10 11:41:49,231 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-10 11:41:49,232 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-11-10 11:41:49,234 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-10 11:41:49,234 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-10 11:41:49,239 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-10 11:41:49,240 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,241 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a192a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49, skipping insertion in model container
[2023-11-10 11:41:49,241 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,291 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-10 11:41:49,414 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009]
[2023-11-10 11:41:49,613 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-10 11:41:49,626 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-10 11:41:49,638 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009]
[2023-11-10 11:41:49,680 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-10 11:41:49,711 WARN  L672               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-10 11:41:49,711 WARN  L672               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-10 11:41:49,717 INFO  L206         MainTranslator]: Completed translation
[2023-11-10 11:41:49,719 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49 WrapperNode
[2023-11-10 11:41:49,719 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-10 11:41:49,720 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-10 11:41:49,720 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-10 11:41:49,720 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-10 11:41:49,726 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,753 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,784 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114
[2023-11-10 11:41:49,785 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-10 11:41:49,785 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-10 11:41:49,786 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-10 11:41:49,786 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-10 11:41:49,793 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,793 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,809 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,809 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,815 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,816 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,818 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,819 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,834 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-10 11:41:49,835 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-10 11:41:49,835 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-10 11:41:49,835 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-10 11:41:49,836 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (1/1) ...
[2023-11-10 11:41:49,840 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-10 11:41:49,851 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:41:49,870 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-10 11:41:49,895 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-10 11:41:49,904 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-10 11:41:49,905 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-10 11:41:49,905 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-10 11:41:49,906 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-10 11:41:49,906 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-10 11:41:49,906 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-11-10 11:41:49,906 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-11-10 11:41:49,906 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-11-10 11:41:49,907 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-11-10 11:41:49,907 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-10 11:41:49,907 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-10 11:41:49,907 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-10 11:41:49,907 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-10 11:41:49,908 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-10 11:41:50,051 INFO  L236             CfgBuilder]: Building ICFG
[2023-11-10 11:41:50,052 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-10 11:41:50,290 INFO  L277             CfgBuilder]: Performing block encoding
[2023-11-10 11:41:50,427 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-10 11:41:50,428 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-10 11:41:50,431 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:41:50 BoogieIcfgContainer
[2023-11-10 11:41:50,431 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-10 11:41:50,433 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-10 11:41:50,433 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-10 11:41:50,436 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-10 11:41:50,436 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:41:49" (1/3) ...
[2023-11-10 11:41:50,442 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17af40aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:41:50, skipping insertion in model container
[2023-11-10 11:41:50,442 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:41:49" (2/3) ...
[2023-11-10 11:41:50,442 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17af40aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:41:50, skipping insertion in model container
[2023-11-10 11:41:50,443 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:41:50" (3/3) ...
[2023-11-10 11:41:50,444 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix034_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i
[2023-11-10 11:41:50,460 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-10 11:41:50,460 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-10 11:41:50,460 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-10 11:41:50,507 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-10 11:41:50,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 200 flow
[2023-11-10 11:41:50,605 INFO  L124   PetriNetUnfolderBase]: 3/94 cut-off events.
[2023-11-10 11:41:50,605 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:41:50,611 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 3/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. 
[2023-11-10 11:41:50,614 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 96 transitions, 200 flow
[2023-11-10 11:41:50,620 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 194 flow
[2023-11-10 11:41:50,637 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-10 11:41:50,643 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@703c5707, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-10 11:41:50,644 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-11-10 11:41:50,656 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-10 11:41:50,656 INFO  L124   PetriNetUnfolderBase]: 1/42 cut-off events.
[2023-11-10 11:41:50,656 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:41:50,657 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:41:50,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:41:50,658 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-10 11:41:50,662 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:41:50,663 INFO  L85        PathProgramCache]: Analyzing trace with hash -1710511136, now seen corresponding path program 1 times
[2023-11-10 11:41:50,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:41:50,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386262597]
[2023-11-10 11:41:50,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:41:50,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:41:50,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:41:51,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:41:51,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:41:51,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386262597]
[2023-11-10 11:41:51,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386262597] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:41:51,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:41:51,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-10 11:41:51,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005452582]
[2023-11-10 11:41:51,180 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:41:51,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:41:51,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:41:51,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:41:51,223 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-10 11:41:51,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96
[2023-11-10 11:41:51,230 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 194 flow. Second operand  has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:51,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:41:51,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96
[2023-11-10 11:41:51,231 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:41:51,344 INFO  L124   PetriNetUnfolderBase]: 18/176 cut-off events.
[2023-11-10 11:41:51,345 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2023-11-10 11:41:51,347 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 228 conditions, 176 events. 18/176 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 506 event pairs, 12 based on Foata normal form. 9/172 useless extension candidates. Maximal degree in co-relation 182. Up to 31 conditions per place. 
[2023-11-10 11:41:51,350 INFO  L140   encePairwiseOnDemand]: 90/96 looper letters, 10 selfloop transitions, 2 changer transitions 0/93 dead transitions.
[2023-11-10 11:41:51,350 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 219 flow
[2023-11-10 11:41:51,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:41:51,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:41:51,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions.
[2023-11-10 11:41:51,368 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9270833333333334
[2023-11-10 11:41:51,368 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 267 transitions.
[2023-11-10 11:41:51,368 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions.
[2023-11-10 11:41:51,372 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:41:51,374 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions.
[2023-11-10 11:41:51,380 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:51,387 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:51,388 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:51,389 INFO  L175             Difference]: Start difference. First operand has 98 places, 94 transitions, 194 flow. Second operand 3 states and 267 transitions.
[2023-11-10 11:41:51,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 219 flow
[2023-11-10 11:41:51,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 93 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-10 11:41:51,397 INFO  L231             Difference]: Finished difference. Result has 96 places, 89 transitions, 186 flow
[2023-11-10 11:41:51,399 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=96, PETRI_TRANSITIONS=89}
[2023-11-10 11:41:51,402 INFO  L281   CegarLoopForPetriNet]: 98 programPoint places, -2 predicate places.
[2023-11-10 11:41:51,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 89 transitions, 186 flow
[2023-11-10 11:41:51,403 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:51,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:41:51,404 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:41:51,404 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-10 11:41:51,404 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-10 11:41:51,405 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:41:51,405 INFO  L85        PathProgramCache]: Analyzing trace with hash -1999225733, now seen corresponding path program 1 times
[2023-11-10 11:41:51,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:41:51,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757330273]
[2023-11-10 11:41:51,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:41:51,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:41:51,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:41:51,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:41:51,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:41:51,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757330273]
[2023-11-10 11:41:51,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757330273] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:41:51,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:41:51,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-10 11:41:51,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187829148]
[2023-11-10 11:41:51,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:41:51,869 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-10 11:41:51,870 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:41:51,870 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-10 11:41:51,870 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-10 11:41:51,873 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 96
[2023-11-10 11:41:51,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 186 flow. Second operand  has 7 states, 7 states have (on average 71.71428571428571) internal successors, (502), 7 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:51,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:41:51,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 96
[2023-11-10 11:41:51,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:41:52,291 INFO  L124   PetriNetUnfolderBase]: 328/862 cut-off events.
[2023-11-10 11:41:52,291 INFO  L125   PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES.
[2023-11-10 11:41:52,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1513 conditions, 862 events. 328/862 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4788 event pairs, 78 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1464. Up to 288 conditions per place. 
[2023-11-10 11:41:52,299 INFO  L140   encePairwiseOnDemand]: 88/96 looper letters, 20 selfloop transitions, 2 changer transitions 51/133 dead transitions.
[2023-11-10 11:41:52,299 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 133 transitions, 418 flow
[2023-11-10 11:41:52,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-10 11:41:52,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-10 11:41:52,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 697 transitions.
[2023-11-10 11:41:52,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8067129629629629
[2023-11-10 11:41:52,304 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 697 transitions.
[2023-11-10 11:41:52,304 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 697 transitions.
[2023-11-10 11:41:52,304 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:41:52,304 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 697 transitions.
[2023-11-10 11:41:52,306 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 77.44444444444444) internal successors, (697), 9 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,311 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,313 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,313 INFO  L175             Difference]: Start difference. First operand has 96 places, 89 transitions, 186 flow. Second operand 9 states and 697 transitions.
[2023-11-10 11:41:52,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 133 transitions, 418 flow
[2023-11-10 11:41:52,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 133 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-10 11:41:52,319 INFO  L231             Difference]: Finished difference. Result has 109 places, 78 transitions, 180 flow
[2023-11-10 11:41:52,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=180, PETRI_PLACES=109, PETRI_TRANSITIONS=78}
[2023-11-10 11:41:52,320 INFO  L281   CegarLoopForPetriNet]: 98 programPoint places, 11 predicate places.
[2023-11-10 11:41:52,321 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 78 transitions, 180 flow
[2023-11-10 11:41:52,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 71.71428571428571) internal successors, (502), 7 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,321 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:41:52,322 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:41:52,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-10 11:41:52,322 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-10 11:41:52,322 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:41:52,322 INFO  L85        PathProgramCache]: Analyzing trace with hash -359075075, now seen corresponding path program 1 times
[2023-11-10 11:41:52,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:41:52,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202421155]
[2023-11-10 11:41:52,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:41:52,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:41:52,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:41:52,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:41:52,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:41:52,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202421155]
[2023-11-10 11:41:52,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202421155] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:41:52,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:41:52,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-10 11:41:52,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284890697]
[2023-11-10 11:41:52,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:41:52,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-10 11:41:52,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:41:52,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-10 11:41:52,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:41:52,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96
[2023-11-10 11:41:52,560 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 78 transitions, 180 flow. Second operand  has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:41:52,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96
[2023-11-10 11:41:52,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:41:52,808 INFO  L124   PetriNetUnfolderBase]: 179/492 cut-off events.
[2023-11-10 11:41:52,808 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2023-11-10 11:41:52,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 908 conditions, 492 events. 179/492 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2460 event pairs, 18 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 870. Up to 105 conditions per place. 
[2023-11-10 11:41:52,811 INFO  L140   encePairwiseOnDemand]: 87/96 looper letters, 26 selfloop transitions, 5 changer transitions 40/130 dead transitions.
[2023-11-10 11:41:52,811 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 130 transitions, 428 flow
[2023-11-10 11:41:52,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-10 11:41:52,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-10 11:41:52,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 793 transitions.
[2023-11-10 11:41:52,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8260416666666667
[2023-11-10 11:41:52,814 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 793 transitions.
[2023-11-10 11:41:52,814 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 793 transitions.
[2023-11-10 11:41:52,814 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:41:52,815 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 793 transitions.
[2023-11-10 11:41:52,817 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 79.3) internal successors, (793), 10 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,818 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,819 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,819 INFO  L175             Difference]: Start difference. First operand has 109 places, 78 transitions, 180 flow. Second operand 10 states and 793 transitions.
[2023-11-10 11:41:52,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 130 transitions, 428 flow
[2023-11-10 11:41:52,821 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 130 transitions, 412 flow, removed 6 selfloop flow, removed 8 redundant places.
[2023-11-10 11:41:52,823 INFO  L231             Difference]: Finished difference. Result has 99 places, 79 transitions, 206 flow
[2023-11-10 11:41:52,823 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=206, PETRI_PLACES=99, PETRI_TRANSITIONS=79}
[2023-11-10 11:41:52,824 INFO  L281   CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places.
[2023-11-10 11:41:52,824 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 206 flow
[2023-11-10 11:41:52,825 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.0) internal successors, (444), 6 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:52,825 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:41:52,825 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:41:52,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-10 11:41:52,826 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-10 11:41:52,826 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:41:52,826 INFO  L85        PathProgramCache]: Analyzing trace with hash 131722968, now seen corresponding path program 1 times
[2023-11-10 11:41:52,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:41:52,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948196202]
[2023-11-10 11:41:52,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:41:52,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:41:52,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:41:53,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:41:53,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:41:53,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948196202]
[2023-11-10 11:41:53,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948196202] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:41:53,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:41:53,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-10 11:41:53,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348007999]
[2023-11-10 11:41:53,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:41:53,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-10 11:41:53,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:41:53,121 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-10 11:41:53,121 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-10 11:41:53,122 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 96
[2023-11-10 11:41:53,123 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 206 flow. Second operand  has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:53,123 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:41:53,123 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 96
[2023-11-10 11:41:53,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:41:53,286 INFO  L124   PetriNetUnfolderBase]: 35/174 cut-off events.
[2023-11-10 11:41:53,286 INFO  L125   PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES.
[2023-11-10 11:41:53,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 384 conditions, 174 events. 35/174 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 462 event pairs, 8 based on Foata normal form. 7/176 useless extension candidates. Maximal degree in co-relation 357. Up to 26 conditions per place. 
[2023-11-10 11:41:53,287 INFO  L140   encePairwiseOnDemand]: 88/96 looper letters, 18 selfloop transitions, 7 changer transitions 19/103 dead transitions.
[2023-11-10 11:41:53,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 387 flow
[2023-11-10 11:41:53,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-10 11:41:53,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-10 11:41:53,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 766 transitions.
[2023-11-10 11:41:53,290 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7979166666666667
[2023-11-10 11:41:53,291 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 766 transitions.
[2023-11-10 11:41:53,291 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 766 transitions.
[2023-11-10 11:41:53,291 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:41:53,291 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 766 transitions.
[2023-11-10 11:41:53,293 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 76.6) internal successors, (766), 10 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:53,295 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:53,295 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 96.0) internal successors, (1056), 11 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:53,295 INFO  L175             Difference]: Start difference. First operand has 99 places, 79 transitions, 206 flow. Second operand 10 states and 766 transitions.
[2023-11-10 11:41:53,296 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 387 flow
[2023-11-10 11:41:53,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 103 transitions, 348 flow, removed 14 selfloop flow, removed 6 redundant places.
[2023-11-10 11:41:53,302 INFO  L231             Difference]: Finished difference. Result has 102 places, 79 transitions, 218 flow
[2023-11-10 11:41:53,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=218, PETRI_PLACES=102, PETRI_TRANSITIONS=79}
[2023-11-10 11:41:53,304 INFO  L281   CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places.
[2023-11-10 11:41:53,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 218 flow
[2023-11-10 11:41:53,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:53,305 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:41:53,305 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:41:53,305 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-10 11:41:53,305 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-10 11:41:53,306 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:41:53,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -311759447, now seen corresponding path program 1 times
[2023-11-10 11:41:53,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:41:53,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466713552]
[2023-11-10 11:41:53,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:41:53,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:41:53,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:41:53,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:41:53,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:41:53,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466713552]
[2023-11-10 11:41:53,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466713552] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:41:53,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:41:53,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-11-10 11:41:53,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998147790]
[2023-11-10 11:41:53,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:41:53,948 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-10 11:41:53,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:41:53,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-10 11:41:53,950 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2023-11-10 11:41:53,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 70 out of 96
[2023-11-10 11:41:53,951 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 79 transitions, 218 flow. Second operand  has 8 states, 8 states have (on average 72.25) internal successors, (578), 8 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:53,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:41:53,952 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 96
[2023-11-10 11:41:53,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:41:54,115 INFO  L124   PetriNetUnfolderBase]: 9/155 cut-off events.
[2023-11-10 11:41:54,115 INFO  L125   PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES.
[2023-11-10 11:41:54,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 303 conditions, 155 events. 9/155 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 345 event pairs, 0 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 248. Up to 25 conditions per place. 
[2023-11-10 11:41:54,116 INFO  L140   encePairwiseOnDemand]: 87/96 looper letters, 18 selfloop transitions, 6 changer transitions 8/93 dead transitions.
[2023-11-10 11:41:54,116 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 93 transitions, 314 flow
[2023-11-10 11:41:54,116 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-10 11:41:54,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-10 11:41:54,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 663 transitions.
[2023-11-10 11:41:54,118 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7673611111111112
[2023-11-10 11:41:54,119 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 663 transitions.
[2023-11-10 11:41:54,119 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 663 transitions.
[2023-11-10 11:41:54,119 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:41:54,122 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 663 transitions.
[2023-11-10 11:41:54,128 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 73.66666666666667) internal successors, (663), 9 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,130 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,130 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,130 INFO  L175             Difference]: Start difference. First operand has 102 places, 79 transitions, 218 flow. Second operand 9 states and 663 transitions.
[2023-11-10 11:41:54,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 93 transitions, 314 flow
[2023-11-10 11:41:54,135 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 268 flow, removed 13 selfloop flow, removed 13 redundant places.
[2023-11-10 11:41:54,137 INFO  L231             Difference]: Finished difference. Result has 99 places, 84 transitions, 219 flow
[2023-11-10 11:41:54,137 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=219, PETRI_PLACES=99, PETRI_TRANSITIONS=84}
[2023-11-10 11:41:54,137 INFO  L281   CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places.
[2023-11-10 11:41:54,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 84 transitions, 219 flow
[2023-11-10 11:41:54,138 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 72.25) internal successors, (578), 8 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:41:54,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:41:54,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-10 11:41:54,139 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-10 11:41:54,139 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:41:54,139 INFO  L85        PathProgramCache]: Analyzing trace with hash 1875366633, now seen corresponding path program 2 times
[2023-11-10 11:41:54,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:41:54,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938471006]
[2023-11-10 11:41:54,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:41:54,140 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:41:54,195 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:41:54,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:41:54,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:41:54,459 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938471006]
[2023-11-10 11:41:54,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938471006] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:41:54,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:41:54,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-10 11:41:54,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165236899]
[2023-11-10 11:41:54,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:41:54,460 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-10 11:41:54,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:41:54,460 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-10 11:41:54,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2023-11-10 11:41:54,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 96
[2023-11-10 11:41:54,462 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 84 transitions, 219 flow. Second operand  has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,462 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:41:54,462 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 96
[2023-11-10 11:41:54,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:41:54,607 INFO  L124   PetriNetUnfolderBase]: 16/181 cut-off events.
[2023-11-10 11:41:54,608 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2023-11-10 11:41:54,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 330 conditions, 181 events. 16/181 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 503 event pairs, 4 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 317. Up to 24 conditions per place. 
[2023-11-10 11:41:54,609 INFO  L140   encePairwiseOnDemand]: 90/96 looper letters, 16 selfloop transitions, 1 changer transitions 18/97 dead transitions.
[2023-11-10 11:41:54,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 344 flow
[2023-11-10 11:41:54,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-10 11:41:54,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-10 11:41:54,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 526 transitions.
[2023-11-10 11:41:54,611 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7827380952380952
[2023-11-10 11:41:54,611 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 526 transitions.
[2023-11-10 11:41:54,611 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 526 transitions.
[2023-11-10 11:41:54,611 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:41:54,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 526 transitions.
[2023-11-10 11:41:54,612 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 75.14285714285714) internal successors, (526), 7 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,614 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,614 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 96.0) internal successors, (768), 8 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,614 INFO  L175             Difference]: Start difference. First operand has 99 places, 84 transitions, 219 flow. Second operand 7 states and 526 transitions.
[2023-11-10 11:41:54,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 344 flow
[2023-11-10 11:41:54,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 97 transitions, 330 flow, removed 7 selfloop flow, removed 4 redundant places.
[2023-11-10 11:41:54,617 INFO  L231             Difference]: Finished difference. Result has 101 places, 79 transitions, 197 flow
[2023-11-10 11:41:54,617 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=101, PETRI_TRANSITIONS=79}
[2023-11-10 11:41:54,617 INFO  L281   CegarLoopForPetriNet]: 98 programPoint places, 3 predicate places.
[2023-11-10 11:41:54,618 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 79 transitions, 197 flow
[2023-11-10 11:41:54,618 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 73.42857142857143) internal successors, (514), 7 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:41:54,618 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:41:54,618 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:41:54,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-10 11:41:54,619 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-10 11:41:54,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:41:54,619 INFO  L85        PathProgramCache]: Analyzing trace with hash 434079747, now seen corresponding path program 3 times
[2023-11-10 11:41:54,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:41:54,619 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022505350]
[2023-11-10 11:41:54,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:41:54,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:41:54,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:41:54,654 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-10 11:41:54,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:41:54,708 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-10 11:41:54,708 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-10 11:41:54,709 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2023-11-10 11:41:54,711 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining)
[2023-11-10 11:41:54,711 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2023-11-10 11:41:54,711 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2023-11-10 11:41:54,711 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining)
[2023-11-10 11:41:54,711 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-10 11:41:54,712 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2023-11-10 11:41:54,717 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-10 11:41:54,717 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-10 11:41:54,758 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-10 11:41:54,760 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-10 11:41:54,777 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:41:54 BasicIcfg
[2023-11-10 11:41:54,777 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-10 11:41:54,778 INFO  L158              Benchmark]: Toolchain (without parser) took 5545.59ms. Allocated memory was 248.5MB in the beginning and 325.1MB in the end (delta: 76.5MB). Free memory was 203.4MB in the beginning and 164.6MB in the end (delta: 38.8MB). Peak memory consumption was 116.4MB. Max. memory is 8.0GB.
[2023-11-10 11:41:54,778 INFO  L158              Benchmark]: CDTParser took 0.83ms. Allocated memory is still 175.1MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-11-10 11:41:54,778 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 485.09ms. Allocated memory is still 248.5MB. Free memory was 203.0MB in the beginning and 180.4MB in the end (delta: 22.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB.
[2023-11-10 11:41:54,779 INFO  L158              Benchmark]: Boogie Procedure Inliner took 64.70ms. Allocated memory is still 248.5MB. Free memory was 180.4MB in the beginning and 177.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-11-10 11:41:54,779 INFO  L158              Benchmark]: Boogie Preprocessor took 48.70ms. Allocated memory is still 248.5MB. Free memory was 177.9MB in the beginning and 176.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-11-10 11:41:54,779 INFO  L158              Benchmark]: RCFGBuilder took 596.13ms. Allocated memory is still 248.5MB. Free memory was 176.2MB in the beginning and 214.4MB in the end (delta: -38.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB.
[2023-11-10 11:41:54,780 INFO  L158              Benchmark]: TraceAbstraction took 4344.50ms. Allocated memory was 248.5MB in the beginning and 325.1MB in the end (delta: 76.5MB). Free memory was 213.9MB in the beginning and 164.6MB in the end (delta: 49.3MB). Peak memory consumption was 125.8MB. Max. memory is 8.0GB.
[2023-11-10 11:41:54,781 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.83ms. Allocated memory is still 175.1MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 485.09ms. Allocated memory is still 248.5MB. Free memory was 203.0MB in the beginning and 180.4MB in the end (delta: 22.7MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 64.70ms. Allocated memory is still 248.5MB. Free memory was 180.4MB in the beginning and 177.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 48.70ms. Allocated memory is still 248.5MB. Free memory was 177.9MB in the beginning and 176.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 596.13ms. Allocated memory is still 248.5MB. Free memory was 176.2MB in the beginning and 214.4MB in the end (delta: -38.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB.
 * TraceAbstraction took 4344.50ms. Allocated memory was 248.5MB in the beginning and 325.1MB in the end (delta: 76.5MB). Free memory was 213.9MB in the beginning and 164.6MB in the end (delta: 49.3MB). Peak memory consumption was 125.8MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L708]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L710]               0  int __unbuffered_p0_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L712]               0  int __unbuffered_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0]
[L714]               0  int __unbuffered_p1_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0]
[L715]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0]
[L716]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L718]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L720]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L722]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L723]               0  _Bool z$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0]
[L724]               0  int z$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0]
[L725]               0  _Bool z$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0]
[L726]               0  _Bool z$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0]
[L727]               0  _Bool z$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0]
[L728]               0  _Bool z$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z=0]
[L729]               0  _Bool z$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0]
[L730]               0  _Bool z$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0]
[L731]               0  _Bool z$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z=0]
[L732]               0  int *z$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0]
[L733]               0  int z$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0]
[L734]               0  _Bool z$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0]
[L735]               0  int z$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0]
[L736]               0  _Bool z$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L737]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L738]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L817]               0  pthread_t t897;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L818]  FCALL, FORK  0  pthread_create(&t897, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L819]               0  pthread_t t898;
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L820]  FCALL, FORK  0  pthread_create(&t898, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L742]               1  z$w_buff1 = z$w_buff0
[L743]               1  z$w_buff0 = 1
[L744]               1  z$w_buff1_used = z$w_buff0_used
[L745]               1  z$w_buff0_used = (_Bool)1
[L746]  CALL         1  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L746]  RET          1  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L747]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L748]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L749]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L750]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L753]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L770]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L773]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L776]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L779]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L780]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L781]               2  z$flush_delayed = weak$$choice2
[L782]               2  z$mem_tmp = z
[L783]               2  z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L784]               2  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L785]               2  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L786]               2  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L787]               2  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L788]               2  z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L789]               2  z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L790]               2  __unbuffered_p1_EBX = z
[L791]               2  z = z$flush_delayed ? z$mem_tmp : z
[L792]               2  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L795]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L796]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L797]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L798]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L799]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L756]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L757]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L758]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L759]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L760]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L763]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L802]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L822]               0  main$tmp_guard0 = __unbuffered_cnt == 2
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L824]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L824]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L826]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L827]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L828]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L829]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L830]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L833]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
        VAL             [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t897={5:0}, t898={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L835]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18]                0  reach_error()
        VAL             [\old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 820]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 115 locations, 5 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: 4.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 515 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 48 mSDtfsCounter, 515 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=5, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 453 NumberOfCodeBlocks, 453 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 1543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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!
[2023-11-10 11:41:54,797 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...