/usr/lib/jvm/java-1.11.0-openjdk-amd64/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i


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


This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m
[2023-11-17 15:18:57,291 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-17 15:18:57,356 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-SemanticLbe.epf
[2023-11-17 15:18:57,380 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-17 15:18:57,381 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-17 15:18:57,381 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-17 15:18:57,382 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-17 15:18:57,382 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-17 15:18:57,382 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-17 15:18:57,385 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-17 15:18:57,386 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-17 15:18:57,386 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-17 15:18:57,386 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-17 15:18:57,387 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-17 15:18:57,387 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-17 15:18:57,387 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-17 15:18:57,388 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-17 15:18:57,389 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-17 15:18:57,389 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-17 15:18:57,389 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-17 15:18:57,389 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-17 15:18:57,390 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-17 15:18:57,390 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-17 15:18:57,390 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-11-17 15:18:57,390 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-17 15:18:57,391 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-17 15:18:57,391 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-17 15:18:57,392 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-17 15:18:57,392 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-17 15:18:57,392 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-17 15:18:57,393 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-17 15:18:57,393 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-17 15:18:57,393 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-17 15:18:57,564 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-17 15:18:57,579 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-17 15:18:57,580 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-17 15:18:57,581 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-17 15:18:57,582 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-17 15:18:57,583 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i
[2023-11-17 15:18:58,581 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-17 15:18:58,758 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-17 15:18:58,759 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i
[2023-11-17 15:18:58,771 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e0727531/cd8ce0cf36ce4f4186cdf0bbab8c7595/FLAG4060dedb6
[2023-11-17 15:18:58,784 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e0727531/cd8ce0cf36ce4f4186cdf0bbab8c7595
[2023-11-17 15:18:58,786 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-17 15:18:58,787 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-11-17 15:18:58,787 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-17 15:18:58,787 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-17 15:18:58,790 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-17 15:18:58,791 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:58" (1/1) ...
[2023-11-17 15:18:58,792 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167fad24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:58, skipping insertion in model container
[2023-11-17 15:18:58,792 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:18:58" (1/1) ...
[2023-11-17 15:18:58,842 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-17 15:18:58,944 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/safe019_rmo.oepc.i[993,1006]
[2023-11-17 15:18:59,103 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-17 15:18:59,117 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-17 15:18:59,128 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/safe019_rmo.oepc.i[993,1006]
[2023-11-17 15:18:59,164 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-17 15:18:59,187 WARN  L675               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-17 15:18:59,188 WARN  L675               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-17 15:18:59,193 INFO  L206         MainTranslator]: Completed translation
[2023-11-17 15:18:59,193 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59 WrapperNode
[2023-11-17 15:18:59,193 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-17 15:18:59,194 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-17 15:18:59,194 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-17 15:18:59,194 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-17 15:18:59,199 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,215 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,236 INFO  L138                Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 184
[2023-11-17 15:18:59,237 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-17 15:18:59,237 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-17 15:18:59,237 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-17 15:18:59,238 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-17 15:18:59,244 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,244 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,256 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,256 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,269 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,270 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,272 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,273 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,276 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-17 15:18:59,290 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-17 15:18:59,290 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-17 15:18:59,290 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-17 15:18:59,291 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (1/1) ...
[2023-11-17 15:18:59,294 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-17 15:18:59,302 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-17 15:18:59,326 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-17 15:18:59,360 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-17 15:18:59,376 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-17 15:18:59,377 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-17 15:18:59,377 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-17 15:18:59,377 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-17 15:18:59,377 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-17 15:18:59,378 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-17 15:18:59,378 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-11-17 15:18:59,378 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-11-17 15:18:59,378 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-11-17 15:18:59,378 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-11-17 15:18:59,378 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-11-17 15:18:59,378 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-11-17 15:18:59,379 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2023-11-17 15:18:59,379 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2023-11-17 15:18:59,379 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-17 15:18:59,379 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-17 15:18:59,379 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-17 15:18:59,379 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-17 15:18:59,381 WARN  L211             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-17 15:18:59,514 INFO  L239             CfgBuilder]: Building ICFG
[2023-11-17 15:18:59,516 INFO  L265             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-17 15:18:59,818 INFO  L280             CfgBuilder]: Performing block encoding
[2023-11-17 15:19:00,078 INFO  L302             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-17 15:19:00,078 INFO  L307             CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-17 15:19:00,080 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:00 BoogieIcfgContainer
[2023-11-17 15:19:00,080 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-17 15:19:00,081 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-17 15:19:00,081 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-17 15:19:00,084 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-17 15:19:00,084 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:18:58" (1/3) ...
[2023-11-17 15:19:00,084 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afc00db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:00, skipping insertion in model container
[2023-11-17 15:19:00,085 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:18:59" (2/3) ...
[2023-11-17 15:19:00,085 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afc00db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:19:00, skipping insertion in model container
[2023-11-17 15:19:00,085 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:19:00" (3/3) ...
[2023-11-17 15:19:00,086 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe019_rmo.oepc.i
[2023-11-17 15:19:00,098 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-17 15:19:00,098 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-17 15:19:00,098 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-17 15:19:00,150 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-17 15:19:00,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 312 flow
[2023-11-17 15:19:00,265 INFO  L124   PetriNetUnfolderBase]: 2/144 cut-off events.
[2023-11-17 15:19:00,265 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 15:19:00,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 157 conditions, 144 events. 2/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. 
[2023-11-17 15:19:00,271 INFO  L82        GeneralOperation]: Start removeDead. Operand has 159 places, 148 transitions, 312 flow
[2023-11-17 15:19:00,279 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 139 places, 127 transitions, 266 flow
[2023-11-17 15:19:00,282 INFO  L115   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2023-11-17 15:19:00,299 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 127 transitions, 266 flow
[2023-11-17 15:19:00,303 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 127 transitions, 266 flow
[2023-11-17 15:19:00,304 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 139 places, 127 transitions, 266 flow
[2023-11-17 15:19:00,343 INFO  L124   PetriNetUnfolderBase]: 1/127 cut-off events.
[2023-11-17 15:19:00,343 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 15:19:00,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 1/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. 
[2023-11-17 15:19:00,347 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2002
[2023-11-17 15:19:07,547 INFO  L134        LiptonReduction]: Checked pairs total: 4295
[2023-11-17 15:19:07,547 INFO  L136        LiptonReduction]: Total number of compositions: 110
[2023-11-17 15:19:07,558 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-17 15:19:07,563 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;@44f0764a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-17 15:19:07,563 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-11-17 15:19:07,567 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-17 15:19:07,568 INFO  L124   PetriNetUnfolderBase]: 0/18 cut-off events.
[2023-11-17 15:19:07,568 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 15:19:07,568 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:07,568 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:07,569 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:07,572 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:07,572 INFO  L85        PathProgramCache]: Analyzing trace with hash -816908702, now seen corresponding path program 1 times
[2023-11-17 15:19:07,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:07,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623161631]
[2023-11-17 15:19:07,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:07,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:07,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:07,758 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-17 15:19:07,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:07,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623161631]
[2023-11-17 15:19:07,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623161631] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:07,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:07,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-17 15:19:07,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92725749]
[2023-11-17 15:19:07,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:07,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-17 15:19:07,769 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:07,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-17 15:19:07,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-17 15:19:07,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 134 out of 258
[2023-11-17 15:19:07,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand  has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 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-17 15:19:07,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:07,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 258
[2023-11-17 15:19:07,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:08,326 INFO  L124   PetriNetUnfolderBase]: 2915/4028 cut-off events.
[2023-11-17 15:19:08,326 INFO  L125   PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES.
[2023-11-17 15:19:08,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8216 conditions, 4028 events. 2915/4028 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16296 event pairs, 2915 based on Foata normal form. 0/4028 useless extension candidates. Maximal degree in co-relation 8204. Up to 4029 conditions per place. 
[2023-11-17 15:19:08,347 INFO  L140   encePairwiseOnDemand]: 257/258 looper letters, 23 selfloop transitions, 0 changer transitions 0/23 dead transitions.
[2023-11-17 15:19:08,347 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 23 transitions, 104 flow
[2023-11-17 15:19:08,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-17 15:19:08,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-17 15:19:08,356 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions.
[2023-11-17 15:19:08,358 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5658914728682171
[2023-11-17 15:19:08,359 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 292 transitions.
[2023-11-17 15:19:08,359 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions.
[2023-11-17 15:19:08,360 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:08,361 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions.
[2023-11-17 15:19:08,364 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 15:19:08,367 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 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-17 15:19:08,367 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 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-17 15:19:08,369 INFO  L175             Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 2 states and 292 transitions.
[2023-11-17 15:19:08,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 23 transitions, 104 flow
[2023-11-17 15:19:08,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-17 15:19:08,373 INFO  L231             Difference]: Finished difference. Result has 33 places, 23 transitions, 54 flow
[2023-11-17 15:19:08,374 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=23}
[2023-11-17 15:19:08,377 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places.
[2023-11-17 15:19:08,377 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 54 flow
[2023-11-17 15:19:08,377 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 138.5) internal successors, (277), 2 states have internal predecessors, (277), 0 states have call successors, (0), 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-17 15:19:08,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:08,377 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:08,377 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-17 15:19:08,378 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:08,378 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:08,378 INFO  L85        PathProgramCache]: Analyzing trace with hash 929762676, now seen corresponding path program 1 times
[2023-11-17 15:19:08,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:08,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80180582]
[2023-11-17 15:19:08,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:08,379 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:08,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:08,619 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-17 15:19:08,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:08,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80180582]
[2023-11-17 15:19:08,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80180582] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:08,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:08,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-17 15:19:08,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687609239]
[2023-11-17 15:19:08,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:08,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 15:19:08,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:08,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 15:19:08,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 15:19:08,622 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 258
[2023-11-17 15:19:08,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 54 flow. Second operand  has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-17 15:19:08,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:08,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 258
[2023-11-17 15:19:08,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:09,127 INFO  L124   PetriNetUnfolderBase]: 2763/3828 cut-off events.
[2023-11-17 15:19:09,127 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 15:19:09,130 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7813 conditions, 3828 events. 2763/3828 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16195 event pairs, 483 based on Foata normal form. 48/3876 useless extension candidates. Maximal degree in co-relation 7810. Up to 3289 conditions per place. 
[2023-11-17 15:19:09,140 INFO  L140   encePairwiseOnDemand]: 255/258 looper letters, 33 selfloop transitions, 2 changer transitions 0/35 dead transitions.
[2023-11-17 15:19:09,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 150 flow
[2023-11-17 15:19:09,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 15:19:09,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 15:19:09,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions.
[2023-11-17 15:19:09,145 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5581395348837209
[2023-11-17 15:19:09,145 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 432 transitions.
[2023-11-17 15:19:09,146 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions.
[2023-11-17 15:19:09,146 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:09,146 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions.
[2023-11-17 15:19:09,148 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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-17 15:19:09,150 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-17 15:19:09,151 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-17 15:19:09,151 INFO  L175             Difference]: Start difference. First operand has 33 places, 23 transitions, 54 flow. Second operand 3 states and 432 transitions.
[2023-11-17 15:19:09,151 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 150 flow
[2023-11-17 15:19:09,151 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-17 15:19:09,152 INFO  L231             Difference]: Finished difference. Result has 36 places, 23 transitions, 62 flow
[2023-11-17 15:19:09,152 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=23}
[2023-11-17 15:19:09,154 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places.
[2023-11-17 15:19:09,154 INFO  L495      AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 62 flow
[2023-11-17 15:19:09,154 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 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-17 15:19:09,155 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:09,155 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:09,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-17 15:19:09,161 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:09,163 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:09,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -1242128960, now seen corresponding path program 1 times
[2023-11-17 15:19:09,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:09,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200472467]
[2023-11-17 15:19:09,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:09,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:09,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:09,383 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-17 15:19:09,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:09,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200472467]
[2023-11-17 15:19:09,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200472467] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:09,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:09,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 15:19:09,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393332445]
[2023-11-17 15:19:09,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:09,385 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 15:19:09,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:09,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 15:19:09,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-17 15:19:09,386 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 129 out of 258
[2023-11-17 15:19:09,387 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 62 flow. Second operand  has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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-17 15:19:09,387 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:09,387 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 258
[2023-11-17 15:19:09,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:09,883 INFO  L124   PetriNetUnfolderBase]: 3611/5060 cut-off events.
[2023-11-17 15:19:09,883 INFO  L125   PetriNetUnfolderBase]: For 428/428 co-relation queries the response was YES.
[2023-11-17 15:19:09,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10808 conditions, 5060 events. 3611/5060 cut-off events. For 428/428 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23982 event pairs, 643 based on Foata normal form. 192/5252 useless extension candidates. Maximal degree in co-relation 10803. Up to 2120 conditions per place. 
[2023-11-17 15:19:09,897 INFO  L140   encePairwiseOnDemand]: 254/258 looper letters, 43 selfloop transitions, 3 changer transitions 7/53 dead transitions.
[2023-11-17 15:19:09,897 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 237 flow
[2023-11-17 15:19:09,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 15:19:09,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 15:19:09,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions.
[2023-11-17 15:19:09,898 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5532945736434108
[2023-11-17 15:19:09,899 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 571 transitions.
[2023-11-17 15:19:09,899 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions.
[2023-11-17 15:19:09,899 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:09,899 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions.
[2023-11-17 15:19:09,900 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 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-17 15:19:09,901 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:09,902 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:09,902 INFO  L175             Difference]: Start difference. First operand has 36 places, 23 transitions, 62 flow. Second operand 4 states and 571 transitions.
[2023-11-17 15:19:09,902 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 237 flow
[2023-11-17 15:19:09,903 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-17 15:19:09,903 INFO  L231             Difference]: Finished difference. Result has 39 places, 23 transitions, 72 flow
[2023-11-17 15:19:09,904 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=23}
[2023-11-17 15:19:09,905 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places.
[2023-11-17 15:19:09,905 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 72 flow
[2023-11-17 15:19:09,905 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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-17 15:19:09,905 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:09,905 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:09,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-17 15:19:09,906 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:09,906 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:09,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 148669581, now seen corresponding path program 1 times
[2023-11-17 15:19:09,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:09,906 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737923141]
[2023-11-17 15:19:09,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:09,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:09,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:10,130 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-17 15:19:10,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:10,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737923141]
[2023-11-17 15:19:10,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737923141] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:10,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:10,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-17 15:19:10,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892546000]
[2023-11-17 15:19:10,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:10,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 15:19:10,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:10,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 15:19:10,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 15:19:10,133 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 258
[2023-11-17 15:19:10,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 72 flow. Second operand  has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-17 15:19:10,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:10,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 258
[2023-11-17 15:19:10,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:10,410 INFO  L124   PetriNetUnfolderBase]: 1763/2508 cut-off events.
[2023-11-17 15:19:10,410 INFO  L125   PetriNetUnfolderBase]: For 1033/1033 co-relation queries the response was YES.
[2023-11-17 15:19:10,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5898 conditions, 2508 events. 1763/2508 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10850 event pairs, 320 based on Foata normal form. 32/2540 useless extension candidates. Maximal degree in co-relation 5891. Up to 2090 conditions per place. 
[2023-11-17 15:19:10,421 INFO  L140   encePairwiseOnDemand]: 255/258 looper letters, 38 selfloop transitions, 2 changer transitions 0/40 dead transitions.
[2023-11-17 15:19:10,421 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 200 flow
[2023-11-17 15:19:10,422 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 15:19:10,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 15:19:10,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions.
[2023-11-17 15:19:10,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5645994832041343
[2023-11-17 15:19:10,423 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 437 transitions.
[2023-11-17 15:19:10,423 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions.
[2023-11-17 15:19:10,423 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:10,423 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions.
[2023-11-17 15:19:10,424 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 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-17 15:19:10,426 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-17 15:19:10,426 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-17 15:19:10,426 INFO  L175             Difference]: Start difference. First operand has 39 places, 23 transitions, 72 flow. Second operand 3 states and 437 transitions.
[2023-11-17 15:19:10,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 200 flow
[2023-11-17 15:19:10,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 183 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-11-17 15:19:10,432 INFO  L231             Difference]: Finished difference. Result has 38 places, 23 transitions, 68 flow
[2023-11-17 15:19:10,432 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=23}
[2023-11-17 15:19:10,433 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places.
[2023-11-17 15:19:10,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 68 flow
[2023-11-17 15:19:10,434 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-17 15:19:10,434 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:10,434 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:10,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-17 15:19:10,434 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:10,434 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:10,434 INFO  L85        PathProgramCache]: Analyzing trace with hash -1573059318, now seen corresponding path program 1 times
[2023-11-17 15:19:10,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:10,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908871067]
[2023-11-17 15:19:10,435 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:10,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:10,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:11,590 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-17 15:19:11,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:11,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908871067]
[2023-11-17 15:19:11,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908871067] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:11,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:11,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-17 15:19:11,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882711294]
[2023-11-17 15:19:11,591 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:11,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-17 15:19:11,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:11,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-17 15:19:11,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42
[2023-11-17 15:19:11,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 258
[2023-11-17 15:19:11,594 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 68 flow. Second operand  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 15:19:11,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:11,597 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 258
[2023-11-17 15:19:11,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:11,915 INFO  L124   PetriNetUnfolderBase]: 1832/2603 cut-off events.
[2023-11-17 15:19:11,916 INFO  L125   PetriNetUnfolderBase]: For 555/555 co-relation queries the response was YES.
[2023-11-17 15:19:11,918 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6047 conditions, 2603 events. 1832/2603 cut-off events. For 555/555 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10287 event pairs, 352 based on Foata normal form. 12/2615 useless extension candidates. Maximal degree in co-relation 6041. Up to 2161 conditions per place. 
[2023-11-17 15:19:11,929 INFO  L140   encePairwiseOnDemand]: 252/258 looper letters, 39 selfloop transitions, 6 changer transitions 0/45 dead transitions.
[2023-11-17 15:19:11,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 215 flow
[2023-11-17 15:19:11,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 15:19:11,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 15:19:11,930 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions.
[2023-11-17 15:19:11,931 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47189922480620156
[2023-11-17 15:19:11,931 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 487 transitions.
[2023-11-17 15:19:11,931 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions.
[2023-11-17 15:19:11,931 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:11,931 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions.
[2023-11-17 15:19:11,932 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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-17 15:19:11,933 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:11,934 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:11,934 INFO  L175             Difference]: Start difference. First operand has 38 places, 23 transitions, 68 flow. Second operand 4 states and 487 transitions.
[2023-11-17 15:19:11,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 215 flow
[2023-11-17 15:19:11,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 207 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-17 15:19:11,935 INFO  L231             Difference]: Finished difference. Result has 41 places, 28 transitions, 105 flow
[2023-11-17 15:19:11,935 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=28}
[2023-11-17 15:19:11,937 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places.
[2023-11-17 15:19:11,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 105 flow
[2023-11-17 15:19:11,938 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 15:19:11,938 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:11,938 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:11,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-17 15:19:11,938 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:11,938 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:11,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -2089261321, now seen corresponding path program 1 times
[2023-11-17 15:19:11,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:11,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108749815]
[2023-11-17 15:19:11,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:11,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:11,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:12,107 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-17 15:19:12,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:12,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108749815]
[2023-11-17 15:19:12,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108749815] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:12,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:12,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 15:19:12,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804388137]
[2023-11-17 15:19:12,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:12,112 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 15:19:12,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:12,113 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 15:19:12,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 15:19:12,113 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 258
[2023-11-17 15:19:12,114 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 105 flow. Second operand  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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-17 15:19:12,114 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:12,114 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 258
[2023-11-17 15:19:12,114 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:12,336 INFO  L124   PetriNetUnfolderBase]: 1402/2061 cut-off events.
[2023-11-17 15:19:12,336 INFO  L125   PetriNetUnfolderBase]: For 1055/1055 co-relation queries the response was YES.
[2023-11-17 15:19:12,339 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5403 conditions, 2061 events. 1402/2061 cut-off events. For 1055/1055 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8465 event pairs, 307 based on Foata normal form. 48/2109 useless extension candidates. Maximal degree in co-relation 5395. Up to 1838 conditions per place. 
[2023-11-17 15:19:12,346 INFO  L140   encePairwiseOnDemand]: 252/258 looper letters, 46 selfloop transitions, 5 changer transitions 0/51 dead transitions.
[2023-11-17 15:19:12,346 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 287 flow
[2023-11-17 15:19:12,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 15:19:12,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 15:19:12,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions.
[2023-11-17 15:19:12,348 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5503875968992248
[2023-11-17 15:19:12,348 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 426 transitions.
[2023-11-17 15:19:12,348 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions.
[2023-11-17 15:19:12,348 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:12,348 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions.
[2023-11-17 15:19:12,349 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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-17 15:19:12,350 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-17 15:19:12,350 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 states have internal predecessors, (1032), 0 states have call successors, (0), 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-17 15:19:12,351 INFO  L175             Difference]: Start difference. First operand has 41 places, 28 transitions, 105 flow. Second operand 3 states and 426 transitions.
[2023-11-17 15:19:12,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 287 flow
[2023-11-17 15:19:12,352 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 287 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-17 15:19:12,353 INFO  L231             Difference]: Finished difference. Result has 44 places, 32 transitions, 138 flow
[2023-11-17 15:19:12,353 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=32}
[2023-11-17 15:19:12,355 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places.
[2023-11-17 15:19:12,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 138 flow
[2023-11-17 15:19:12,355 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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-17 15:19:12,355 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:12,356 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:12,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-17 15:19:12,356 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:12,356 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:12,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 344051591, now seen corresponding path program 1 times
[2023-11-17 15:19:12,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:12,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595530062]
[2023-11-17 15:19:12,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:12,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:12,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:12,504 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-17 15:19:12,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:12,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595530062]
[2023-11-17 15:19:12,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595530062] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:12,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:12,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 15:19:12,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98437920]
[2023-11-17 15:19:12,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:12,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 15:19:12,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:12,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 15:19:12,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 15:19:12,506 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 258
[2023-11-17 15:19:12,506 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 138 flow. Second operand  has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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-17 15:19:12,507 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:12,507 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 258
[2023-11-17 15:19:12,507 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:12,717 INFO  L124   PetriNetUnfolderBase]: 832/1297 cut-off events.
[2023-11-17 15:19:12,717 INFO  L125   PetriNetUnfolderBase]: For 759/759 co-relation queries the response was YES.
[2023-11-17 15:19:12,719 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 1297 events. 832/1297 cut-off events. For 759/759 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5232 event pairs, 141 based on Foata normal form. 79/1376 useless extension candidates. Maximal degree in co-relation 4058. Up to 684 conditions per place. 
[2023-11-17 15:19:12,723 INFO  L140   encePairwiseOnDemand]: 252/258 looper letters, 63 selfloop transitions, 9 changer transitions 0/72 dead transitions.
[2023-11-17 15:19:12,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 436 flow
[2023-11-17 15:19:12,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 15:19:12,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 15:19:12,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions.
[2023-11-17 15:19:12,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5523255813953488
[2023-11-17 15:19:12,725 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 570 transitions.
[2023-11-17 15:19:12,726 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions.
[2023-11-17 15:19:12,726 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:12,726 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions.
[2023-11-17 15:19:12,727 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 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-17 15:19:12,728 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:12,728 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:12,729 INFO  L175             Difference]: Start difference. First operand has 44 places, 32 transitions, 138 flow. Second operand 4 states and 570 transitions.
[2023-11-17 15:19:12,729 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 436 flow
[2023-11-17 15:19:12,731 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-17 15:19:12,732 INFO  L231             Difference]: Finished difference. Result has 47 places, 36 transitions, 185 flow
[2023-11-17 15:19:12,732 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=47, PETRI_TRANSITIONS=36}
[2023-11-17 15:19:12,733 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places.
[2023-11-17 15:19:12,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 185 flow
[2023-11-17 15:19:12,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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-17 15:19:12,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:12,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:12,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-17 15:19:12,733 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:12,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:12,734 INFO  L85        PathProgramCache]: Analyzing trace with hash -1334820836, now seen corresponding path program 1 times
[2023-11-17 15:19:12,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:12,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133145160]
[2023-11-17 15:19:12,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:12,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:12,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:12,892 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-17 15:19:12,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:12,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133145160]
[2023-11-17 15:19:12,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133145160] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:12,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:12,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-17 15:19:12,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442904739]
[2023-11-17 15:19:12,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:12,893 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-17 15:19:12,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:12,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-17 15:19:12,893 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2023-11-17 15:19:12,894 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 258
[2023-11-17 15:19:12,894 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 185 flow. Second operand  has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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-17 15:19:12,894 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:12,894 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 258
[2023-11-17 15:19:12,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:13,050 INFO  L124   PetriNetUnfolderBase]: 598/945 cut-off events.
[2023-11-17 15:19:13,050 INFO  L125   PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES.
[2023-11-17 15:19:13,052 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3333 conditions, 945 events. 598/945 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3685 event pairs, 106 based on Foata normal form. 45/990 useless extension candidates. Maximal degree in co-relation 3322. Up to 390 conditions per place. 
[2023-11-17 15:19:13,057 INFO  L140   encePairwiseOnDemand]: 252/258 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions.
[2023-11-17 15:19:13,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 548 flow
[2023-11-17 15:19:13,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-17 15:19:13,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-17 15:19:13,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions.
[2023-11-17 15:19:13,062 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5511627906976744
[2023-11-17 15:19:13,062 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 711 transitions.
[2023-11-17 15:19:13,062 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions.
[2023-11-17 15:19:13,062 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:13,062 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions.
[2023-11-17 15:19:13,063 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 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-17 15:19:13,065 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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-17 15:19:13,065 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 0 states have call successors, (0), 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-17 15:19:13,065 INFO  L175             Difference]: Start difference. First operand has 47 places, 36 transitions, 185 flow. Second operand 5 states and 711 transitions.
[2023-11-17 15:19:13,065 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 548 flow
[2023-11-17 15:19:13,068 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 530 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-11-17 15:19:13,069 INFO  L231             Difference]: Finished difference. Result has 50 places, 40 transitions, 235 flow
[2023-11-17 15:19:13,069 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=40}
[2023-11-17 15:19:13,070 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places.
[2023-11-17 15:19:13,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 235 flow
[2023-11-17 15:19:13,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 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-17 15:19:13,071 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:13,071 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:13,071 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-17 15:19:13,071 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:13,074 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:13,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -276837516, now seen corresponding path program 1 times
[2023-11-17 15:19:13,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:13,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687628475]
[2023-11-17 15:19:13,075 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:13,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:13,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:13,991 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-17 15:19:13,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:13,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687628475]
[2023-11-17 15:19:13,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687628475] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:13,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:13,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-17 15:19:13,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502328354]
[2023-11-17 15:19:13,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:13,992 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-17 15:19:13,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:13,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-17 15:19:13,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2023-11-17 15:19:13,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 118 out of 258
[2023-11-17 15:19:13,994 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 235 flow. Second operand  has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 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-17 15:19:13,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:13,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 258
[2023-11-17 15:19:13,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:14,325 INFO  L124   PetriNetUnfolderBase]: 785/1259 cut-off events.
[2023-11-17 15:19:14,326 INFO  L125   PetriNetUnfolderBase]: For 2350/2350 co-relation queries the response was YES.
[2023-11-17 15:19:14,328 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4627 conditions, 1259 events. 785/1259 cut-off events. For 2350/2350 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5151 event pairs, 321 based on Foata normal form. 9/1268 useless extension candidates. Maximal degree in co-relation 4615. Up to 848 conditions per place. 
[2023-11-17 15:19:14,331 INFO  L140   encePairwiseOnDemand]: 252/258 looper letters, 51 selfloop transitions, 8 changer transitions 6/65 dead transitions.
[2023-11-17 15:19:14,331 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 65 transitions, 526 flow
[2023-11-17 15:19:14,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 15:19:14,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 15:19:14,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions.
[2023-11-17 15:19:14,346 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4932170542635659
[2023-11-17 15:19:14,346 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 509 transitions.
[2023-11-17 15:19:14,346 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions.
[2023-11-17 15:19:14,347 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:14,347 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions.
[2023-11-17 15:19:14,347 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 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-17 15:19:14,349 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:14,349 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 0 states have call successors, (0), 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-17 15:19:14,349 INFO  L175             Difference]: Start difference. First operand has 50 places, 40 transitions, 235 flow. Second operand 4 states and 509 transitions.
[2023-11-17 15:19:14,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 65 transitions, 526 flow
[2023-11-17 15:19:14,352 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 460 flow, removed 16 selfloop flow, removed 3 redundant places.
[2023-11-17 15:19:14,353 INFO  L231             Difference]: Finished difference. Result has 51 places, 43 transitions, 242 flow
[2023-11-17 15:19:14,353 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=43}
[2023-11-17 15:19:14,354 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places.
[2023-11-17 15:19:14,354 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 242 flow
[2023-11-17 15:19:14,354 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 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-17 15:19:14,354 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:14,354 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:14,354 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-17 15:19:14,355 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:14,355 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:14,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 838303319, now seen corresponding path program 1 times
[2023-11-17 15:19:14,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:14,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624553757]
[2023-11-17 15:19:14,355 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:14,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:14,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 15:19:14,706 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-17 15:19:14,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 15:19:14,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624553757]
[2023-11-17 15:19:14,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624553757] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 15:19:14,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 15:19:14,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-17 15:19:14,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088671620]
[2023-11-17 15:19:14,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 15:19:14,707 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-17 15:19:14,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 15:19:14,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-17 15:19:14,708 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-17 15:19:14,708 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 128 out of 258
[2023-11-17 15:19:14,709 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 242 flow. Second operand  has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 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-17 15:19:14,709 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 15:19:14,709 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 258
[2023-11-17 15:19:14,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 15:19:15,019 INFO  L124   PetriNetUnfolderBase]: 737/1159 cut-off events.
[2023-11-17 15:19:15,019 INFO  L125   PetriNetUnfolderBase]: For 1480/1480 co-relation queries the response was YES.
[2023-11-17 15:19:15,021 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4146 conditions, 1159 events. 737/1159 cut-off events. For 1480/1480 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4893 event pairs, 115 based on Foata normal form. 20/1179 useless extension candidates. Maximal degree in co-relation 4133. Up to 492 conditions per place. 
[2023-11-17 15:19:15,024 INFO  L140   encePairwiseOnDemand]: 252/258 looper letters, 76 selfloop transitions, 17 changer transitions 3/96 dead transitions.
[2023-11-17 15:19:15,024 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 699 flow
[2023-11-17 15:19:15,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-17 15:19:15,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-17 15:19:15,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions.
[2023-11-17 15:19:15,039 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5419896640826873
[2023-11-17 15:19:15,039 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 839 transitions.
[2023-11-17 15:19:15,039 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 839 transitions.
[2023-11-17 15:19:15,039 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 15:19:15,039 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 839 transitions.
[2023-11-17 15:19:15,040 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 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-17 15:19:15,042 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 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-17 15:19:15,042 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 258.0) internal successors, (1806), 7 states have internal predecessors, (1806), 0 states have call successors, (0), 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-17 15:19:15,042 INFO  L175             Difference]: Start difference. First operand has 51 places, 43 transitions, 242 flow. Second operand 6 states and 839 transitions.
[2023-11-17 15:19:15,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 699 flow
[2023-11-17 15:19:15,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 96 transitions, 654 flow, removed 4 selfloop flow, removed 4 redundant places.
[2023-11-17 15:19:15,050 INFO  L231             Difference]: Finished difference. Result has 53 places, 43 transitions, 265 flow
[2023-11-17 15:19:15,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=53, PETRI_TRANSITIONS=43}
[2023-11-17 15:19:15,050 INFO  L281   CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places.
[2023-11-17 15:19:15,050 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 265 flow
[2023-11-17 15:19:15,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 131.33333333333334) internal successors, (788), 6 states have internal predecessors, (788), 0 states have call successors, (0), 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-17 15:19:15,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 15:19:15,051 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:15,059 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-17 15:19:15,059 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-17 15:19:15,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 15:19:15,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -1244778574, now seen corresponding path program 1 times
[2023-11-17 15:19:15,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 15:19:15,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986593989]
[2023-11-17 15:19:15,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 15:19:15,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 15:19:15,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-17 15:19:15,151 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-17 15:19:15,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-17 15:19:15,261 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-17 15:19:15,261 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-17 15:19:15,262 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining)
[2023-11-17 15:19:15,263 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining)
[2023-11-17 15:19:15,264 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining)
[2023-11-17 15:19:15,264 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining)
[2023-11-17 15:19:15,264 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining)
[2023-11-17 15:19:15,264 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-17 15:19:15,264 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 15:19:15,267 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-17 15:19:15,268 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-17 15:19:15,333 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated
[2023-11-17 15:19:15,336 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated
[2023-11-17 15:19:15,338 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated
[2023-11-17 15:19:15,339 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre23 could not be translated
[2023-11-17 15:19:15,361 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:19:15 BasicIcfg
[2023-11-17 15:19:15,362 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-17 15:19:15,362 INFO  L158              Benchmark]: Toolchain (without parser) took 16575.40ms. Allocated memory was 251.7MB in the beginning and 569.4MB in the end (delta: 317.7MB). Free memory was 204.2MB in the beginning and 361.8MB in the end (delta: -157.6MB). Peak memory consumption was 161.2MB. Max. memory is 8.0GB.
[2023-11-17 15:19:15,362 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory was 147.2MB in the beginning and 147.0MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB.
[2023-11-17 15:19:15,362 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 406.07ms. Allocated memory is still 251.7MB. Free memory was 204.2MB in the beginning and 179.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB.
[2023-11-17 15:19:15,362 INFO  L158              Benchmark]: Boogie Procedure Inliner took 42.82ms. Allocated memory is still 251.7MB. Free memory was 179.5MB in the beginning and 176.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-11-17 15:19:15,363 INFO  L158              Benchmark]: Boogie Preprocessor took 38.43ms. Allocated memory is still 251.7MB. Free memory was 176.4MB in the beginning and 174.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-11-17 15:19:15,363 INFO  L158              Benchmark]: RCFGBuilder took 789.93ms. Allocated memory is still 251.7MB. Free memory was 174.3MB in the beginning and 204.1MB in the end (delta: -29.9MB). Peak memory consumption was 73.9MB. Max. memory is 8.0GB.
[2023-11-17 15:19:15,363 INFO  L158              Benchmark]: TraceAbstraction took 15280.19ms. Allocated memory was 251.7MB in the beginning and 569.4MB in the end (delta: 317.7MB). Free memory was 203.6MB in the beginning and 361.8MB in the end (delta: -158.2MB). Peak memory consumption was 159.6MB. Max. memory is 8.0GB.
[2023-11-17 15:19:15,364 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.12ms. Allocated memory is still 198.2MB. Free memory was 147.2MB in the beginning and 147.0MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 406.07ms. Allocated memory is still 251.7MB. Free memory was 204.2MB in the beginning and 179.5MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 42.82ms. Allocated memory is still 251.7MB. Free memory was 179.5MB in the beginning and 176.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 38.43ms. Allocated memory is still 251.7MB. Free memory was 176.4MB in the beginning and 174.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 789.93ms. Allocated memory is still 251.7MB. Free memory was 174.3MB in the beginning and 204.1MB in the end (delta: -29.9MB). Peak memory consumption was 73.9MB. Max. memory is 8.0GB.
 * TraceAbstraction took 15280.19ms. Allocated memory was 251.7MB in the beginning and 569.4MB in the end (delta: 317.7MB). Free memory was 203.6MB in the beginning and 361.8MB in the end (delta: -158.2MB). Peak memory consumption was 159.6MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre17 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre19 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre21 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre23 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:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 7.2s, 139 PlacesBefore, 36 PlacesAfterwards, 127 TransitionsBefore, 24 TransitionsAfterwards, 2002 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 110 TotalNumberOfCompositions, 4295 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2141, independent: 1973, independent conditional: 0, independent unconditional: 1973, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1338, independent: 1281, independent conditional: 0, independent unconditional: 1281, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1338, independent: 1252, independent conditional: 0, independent unconditional: 1252, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 470, independent: 27, independent conditional: 0, independent unconditional: 27, dependent: 443, dependent conditional: 0, dependent unconditional: 443, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 2141, independent: 692, independent conditional: 0, independent unconditional: 692, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 1338, unknown conditional: 0, unknown unconditional: 1338] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L711]               0  int __unbuffered_cnt = 0;
[L713]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  _Bool __unbuffered_p0_EAX$flush_delayed;
[L715]               0  int __unbuffered_p0_EAX$mem_tmp;
[L716]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L717]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L718]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L719]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L720]               0  _Bool __unbuffered_p0_EAX$r_buff0_thd4;
[L721]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L722]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L723]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L724]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L725]               0  _Bool __unbuffered_p0_EAX$r_buff1_thd4;
[L726]               0  _Bool __unbuffered_p0_EAX$read_delayed;
[L727]               0  int *__unbuffered_p0_EAX$read_delayed_var;
[L728]               0  int __unbuffered_p0_EAX$w_buff0;
[L729]               0  _Bool __unbuffered_p0_EAX$w_buff0_used;
[L730]               0  int __unbuffered_p0_EAX$w_buff1;
[L731]               0  _Bool __unbuffered_p0_EAX$w_buff1_used;
[L733]               0  int __unbuffered_p0_EBX = 0;
[L735]               0  int __unbuffered_p2_EAX = 0;
[L736]               0  _Bool main$tmp_guard0;
[L737]               0  _Bool main$tmp_guard1;
[L739]               0  int x = 0;
[L741]               0  int y = 0;
[L742]               0  _Bool y$flush_delayed;
[L743]               0  int y$mem_tmp;
[L744]               0  _Bool y$r_buff0_thd0;
[L745]               0  _Bool y$r_buff0_thd1;
[L746]               0  _Bool y$r_buff0_thd2;
[L747]               0  _Bool y$r_buff0_thd3;
[L748]               0  _Bool y$r_buff0_thd4;
[L749]               0  _Bool y$r_buff1_thd0;
[L750]               0  _Bool y$r_buff1_thd1;
[L751]               0  _Bool y$r_buff1_thd2;
[L752]               0  _Bool y$r_buff1_thd3;
[L753]               0  _Bool y$r_buff1_thd4;
[L754]               0  _Bool y$read_delayed;
[L755]               0  int *y$read_delayed_var;
[L756]               0  int y$w_buff0;
[L757]               0  _Bool y$w_buff0_used;
[L758]               0  int y$w_buff1;
[L759]               0  _Bool y$w_buff1_used;
[L760]               0  _Bool weak$$choice0;
[L761]               0  _Bool weak$$choice1;
[L762]               0  _Bool weak$$choice2;
[L853]               0  pthread_t t2241;
[L854]  FCALL, FORK  0  pthread_create(&t2241, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L766]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L767]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L768]               1  y$flush_delayed = weak$$choice2
[L769]  EXPR         1  \read(y)
[L769]               1  y$mem_tmp = y
[L770]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L770]  EXPR         1  \read(y)
[L770]  EXPR         1  !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L770]               1  y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L771]               1  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L772]               1  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L773]               1  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L774]               1  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L775]               1  y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L776]               1  y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L777]               1  __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L778]               1  __unbuffered_p0_EAX$read_delayed_var = &y
[L779]  EXPR         1  \read(y)
[L779]               1  __unbuffered_p0_EAX = y
[L780]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L780]  EXPR         1  \read(y)
[L780]  EXPR         1  y$flush_delayed ? y$mem_tmp : y
[L780]               1  y = y$flush_delayed ? y$mem_tmp : y
[L781]               1  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L855]               0  pthread_t t2242;
[L784]               1  __unbuffered_p0_EBX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L856]  FCALL, FORK  0  pthread_create(&t2242, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241={6:0}, t2242={7:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L796]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L857]               0  pthread_t t2243;
[L858]  FCALL, FORK  0  pthread_create(&t2243, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241={6:0}, t2242={7:0}, t2243={8:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L859]               0  pthread_t t2244;
[L808]               3  __unbuffered_p2_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L860]  FCALL, FORK  0  pthread_create(&t2244, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2241={6:0}, t2242={7:0}, t2243={8:0}, t2244={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L811]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L814]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L814]  EXPR         3  \read(y)
[L814]  EXPR         3  y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L814]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L814]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L815]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L816]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L817]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L818]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L828]               4  y = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L831]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L831]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L831]  EXPR         4  \read(y)
[L831]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L831]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L831]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L832]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L833]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L834]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L835]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L789]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L791]               1  return 0;
[L801]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L803]               2  return 0;
[L821]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L823]               3  return 0;
[L838]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L840]               4  return 0;
[L862]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L864]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L4]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L864]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L866]  EXPR         0  \read(y)
[L866]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L866]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L866]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L867]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L868]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L869]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L870]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241={6:0}, t2242={7:0}, t2243={8:0}, t2244={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]
[L873]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L874]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L875]               0  y$flush_delayed = weak$$choice2
[L876]  EXPR         0  \read(y)
[L876]               0  y$mem_tmp = y
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]  EXPR         0  \read(y)
[L877]  EXPR         0  !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L877]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L878]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L879]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L880]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L881]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L883]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L884]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L885]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L885]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L885]  EXPR         0  \read(*__unbuffered_p0_EAX$read_delayed_var)
[L885]  EXPR         0  weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L885]  EXPR         0  __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L885]               0  __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L886]  EXPR         0  \read(y)
[L886]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1)
[L887]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L887]  EXPR         0  \read(y)
[L887]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L887]               0  y = y$flush_delayed ? y$mem_tmp : y
[L888]               0  y$flush_delayed = (_Bool)0
[L890]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}]

  - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 181 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: 15.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 571 IncrementalHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 0 mSDtfsCounter, 571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=10, InterpolantAutomatonStates: 38, 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.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-17 15:19:15,410 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...