/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i


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


This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m
[2023-11-10 11:55:30,461 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-10 11:55:30,525 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf
[2023-11-10 11:55:30,557 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-10 11:55:30,558 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-10 11:55:30,559 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-10 11:55:30,559 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-10 11:55:30,560 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-10 11:55:30,560 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-10 11:55:30,564 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-10 11:55:30,564 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-10 11:55:30,564 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-10 11:55:30,565 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-10 11:55:30,566 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-10 11:55:30,566 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-10 11:55:30,566 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-10 11:55:30,566 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-10 11:55:30,567 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-10 11:55:30,567 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-10 11:55:30,567 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-10 11:55:30,567 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-10 11:55:30,568 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-10 11:55:30,568 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-10 11:55:30,568 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-11-10 11:55:30,569 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-10 11:55:30,570 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-10 11:55:30,570 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-10 11:55:30,570 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-10 11:55:30,571 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-10 11:55:30,571 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-10 11:55:30,572 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-10 11:55:30,572 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-10 11:55:30,572 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-10 11:55:30,572 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2023-11-10 11:55:30,812 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-10 11:55:30,837 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-10 11:55:30,838 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-10 11:55:30,839 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-10 11:55:30,840 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-10 11:55:30,841 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i
[2023-11-10 11:55:31,988 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-10 11:55:32,229 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-10 11:55:32,230 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i
[2023-11-10 11:55:32,246 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d06f88499/28d3040ddb4e43958b67f050cfc90c7c/FLAG1a19fd582
[2023-11-10 11:55:32,258 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d06f88499/28d3040ddb4e43958b67f050cfc90c7c
[2023-11-10 11:55:32,260 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-10 11:55:32,261 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-11-10 11:55:32,262 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-10 11:55:32,262 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-10 11:55:32,266 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-10 11:55:32,267 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,267 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cfbe4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32, skipping insertion in model container
[2023-11-10 11:55:32,268 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,313 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-10 11:55:32,675 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i[41322,41335]
[2023-11-10 11:55:32,696 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-10 11:55:32,707 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-10 11:55:32,743 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_06-cond_racing1.i[41322,41335]
[2023-11-10 11:55:32,749 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-10 11:55:32,811 INFO  L206         MainTranslator]: Completed translation
[2023-11-10 11:55:32,811 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32 WrapperNode
[2023-11-10 11:55:32,811 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-10 11:55:32,812 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-10 11:55:32,813 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-10 11:55:32,813 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-10 11:55:32,819 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,849 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,873 INFO  L138                Inliner]: procedures = 270, calls = 36, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90
[2023-11-10 11:55:32,873 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-10 11:55:32,874 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-10 11:55:32,874 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-10 11:55:32,874 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-10 11:55:32,882 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,882 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,899 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,900 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,905 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,917 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,918 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,919 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,928 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-10 11:55:32,928 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-10 11:55:32,929 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-10 11:55:32,929 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-10 11:55:32,929 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (1/1) ...
[2023-11-10 11:55:32,936 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-10 11:55:32,949 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:32,968 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-10 11:55:32,976 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-10 11:55:33,005 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-10 11:55:33,005 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-10 11:55:33,005 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-10 11:55:33,005 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-10 11:55:33,006 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-10 11:55:33,006 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-10 11:55:33,006 INFO  L130     BoogieDeclarations]: Found specification of procedure t_fun
[2023-11-10 11:55:33,006 INFO  L138     BoogieDeclarations]: Found implementation of procedure t_fun
[2023-11-10 11:55:33,007 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-10 11:55:33,007 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-10 11:55:33,007 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-10 11:55:33,008 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-10 11:55:33,127 INFO  L236             CfgBuilder]: Building ICFG
[2023-11-10 11:55:33,129 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-10 11:55:33,298 INFO  L277             CfgBuilder]: Performing block encoding
[2023-11-10 11:55:33,306 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-10 11:55:33,306 INFO  L302             CfgBuilder]: Removed 10 assume(true) statements.
[2023-11-10 11:55:33,309 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:33 BoogieIcfgContainer
[2023-11-10 11:55:33,309 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-10 11:55:33,311 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-10 11:55:33,312 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-10 11:55:33,314 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-10 11:55:33,315 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:55:32" (1/3) ...
[2023-11-10 11:55:33,315 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67975def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:33, skipping insertion in model container
[2023-11-10 11:55:33,315 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:55:32" (2/3) ...
[2023-11-10 11:55:33,316 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67975def and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:55:33, skipping insertion in model container
[2023-11-10 11:55:33,316 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:55:33" (3/3) ...
[2023-11-10 11:55:33,317 INFO  L112   eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i
[2023-11-10 11:55:33,329 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-10 11:55:33,330 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-11-10 11:55:33,330 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-10 11:55:33,374 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-10 11:55:33,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 111 places, 123 transitions, 253 flow
[2023-11-10 11:55:33,488 INFO  L124   PetriNetUnfolderBase]: 23/170 cut-off events.
[2023-11-10 11:55:33,488 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2023-11-10 11:55:33,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 175 conditions, 170 events. 23/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 394 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 83. Up to 6 conditions per place. 
[2023-11-10 11:55:33,500 INFO  L82        GeneralOperation]: Start removeDead. Operand has 111 places, 123 transitions, 253 flow
[2023-11-10 11:55:33,506 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 107 places, 118 transitions, 240 flow
[2023-11-10 11:55:33,522 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-10 11:55:33,529 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;@2969cd33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-10 11:55:33,531 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2023-11-10 11:55:33,565 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-10 11:55:33,565 INFO  L124   PetriNetUnfolderBase]: 8/102 cut-off events.
[2023-11-10 11:55:33,565 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:55:33,565 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:33,566 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:33,566 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:33,572 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:33,572 INFO  L85        PathProgramCache]: Analyzing trace with hash -858161012, now seen corresponding path program 1 times
[2023-11-10 11:55:33,579 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:33,579 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750650044]
[2023-11-10 11:55:33,579 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:33,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:33,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:33,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:33,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:33,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750650044]
[2023-11-10 11:55:33,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750650044] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:33,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:55:33,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-10 11:55:33,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300184854]
[2023-11-10 11:55:33,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:33,949 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:33,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:33,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:33,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-10 11:55:33,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 123
[2023-11-10 11:55:33,978 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 118 transitions, 240 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:33,978 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:33,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 123
[2023-11-10 11:55:33,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:34,016 INFO  L124   PetriNetUnfolderBase]: 3/110 cut-off events.
[2023-11-10 11:55:34,016 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:55:34,017 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127 conditions, 110 events. 3/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 30/134 useless extension candidates. Maximal degree in co-relation 75. Up to 8 conditions per place. 
[2023-11-10 11:55:34,018 INFO  L140   encePairwiseOnDemand]: 109/123 looper letters, 9 selfloop transitions, 2 changer transitions 21/108 dead transitions.
[2023-11-10 11:55:34,018 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 244 flow
[2023-11-10 11:55:34,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:34,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:34,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions.
[2023-11-10 11:55:34,030 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8970189701897019
[2023-11-10 11:55:34,030 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 331 transitions.
[2023-11-10 11:55:34,031 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions.
[2023-11-10 11:55:34,032 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:34,034 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions.
[2023-11-10 11:55:34,037 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,040 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,041 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,042 INFO  L175             Difference]: Start difference. First operand has 107 places, 118 transitions, 240 flow. Second operand 3 states and 331 transitions.
[2023-11-10 11:55:34,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 244 flow
[2023-11-10 11:55:34,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-10 11:55:34,048 INFO  L231             Difference]: Finished difference. Result has 109 places, 85 transitions, 182 flow
[2023-11-10 11:55:34,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=109, PETRI_TRANSITIONS=85}
[2023-11-10 11:55:34,053 INFO  L281   CegarLoopForPetriNet]: 107 programPoint places, 2 predicate places.
[2023-11-10 11:55:34,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 85 transitions, 182 flow
[2023-11-10 11:55:34,054 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,054 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:34,054 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:34,054 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-10 11:55:34,054 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:34,055 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:34,055 INFO  L85        PathProgramCache]: Analyzing trace with hash 800827827, now seen corresponding path program 1 times
[2023-11-10 11:55:34,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:34,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656556793]
[2023-11-10 11:55:34,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:34,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:34,083 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:34,083 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-10 11:55:34,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:34,118 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-10 11:55:34,119 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-10 11:55:34,120 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining)
[2023-11-10 11:55:34,121 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining)
[2023-11-10 11:55:34,122 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-10 11:55:34,122 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2023-11-10 11:55:34,124 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-10 11:55:34,124 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-10 11:55:34,147 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-10 11:55:34,150 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 136 places, 153 transitions, 322 flow
[2023-11-10 11:55:34,198 INFO  L124   PetriNetUnfolderBase]: 40/273 cut-off events.
[2023-11-10 11:55:34,199 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2023-11-10 11:55:34,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 285 conditions, 273 events. 40/273 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 790 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 172. Up to 9 conditions per place. 
[2023-11-10 11:55:34,204 INFO  L82        GeneralOperation]: Start removeDead. Operand has 136 places, 153 transitions, 322 flow
[2023-11-10 11:55:34,208 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 136 places, 153 transitions, 322 flow
[2023-11-10 11:55:34,209 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-10 11:55:34,211 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;@2969cd33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-10 11:55:34,211 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2023-11-10 11:55:34,228 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-10 11:55:34,229 INFO  L124   PetriNetUnfolderBase]: 8/102 cut-off events.
[2023-11-10 11:55:34,229 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:55:34,229 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:34,229 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:34,229 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:34,230 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:34,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -2084915675, now seen corresponding path program 1 times
[2023-11-10 11:55:34,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:34,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393507903]
[2023-11-10 11:55:34,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:34,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:34,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:34,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:34,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:34,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393507903]
[2023-11-10 11:55:34,314 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393507903] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:34,314 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:55:34,314 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-10 11:55:34,314 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220770330]
[2023-11-10 11:55:34,314 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:34,315 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:34,315 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:34,316 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:34,316 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-10 11:55:34,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 153
[2023-11-10 11:55:34,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 153 transitions, 322 flow. Second operand  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:34,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 153
[2023-11-10 11:55:34,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:34,386 INFO  L124   PetriNetUnfolderBase]: 8/215 cut-off events.
[2023-11-10 11:55:34,387 INFO  L125   PetriNetUnfolderBase]: For 14/36 co-relation queries the response was YES.
[2023-11-10 11:55:34,388 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 254 conditions, 215 events. 8/215 cut-off events. For 14/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 550 event pairs, 0 based on Foata normal form. 111/312 useless extension candidates. Maximal degree in co-relation 141. Up to 22 conditions per place. 
[2023-11-10 11:55:34,388 INFO  L140   encePairwiseOnDemand]: 133/153 looper letters, 12 selfloop transitions, 2 changer transitions 27/139 dead transitions.
[2023-11-10 11:55:34,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 328 flow
[2023-11-10 11:55:34,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:34,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:34,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions.
[2023-11-10 11:55:34,394 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2023-11-10 11:55:34,395 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 408 transitions.
[2023-11-10 11:55:34,395 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions.
[2023-11-10 11:55:34,399 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:34,402 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions.
[2023-11-10 11:55:34,404 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,405 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,405 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,405 INFO  L175             Difference]: Start difference. First operand has 136 places, 153 transitions, 322 flow. Second operand 3 states and 408 transitions.
[2023-11-10 11:55:34,406 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 328 flow
[2023-11-10 11:55:34,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-10 11:55:34,409 INFO  L231             Difference]: Finished difference. Result has 138 places, 109 transitions, 238 flow
[2023-11-10 11:55:34,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=138, PETRI_TRANSITIONS=109}
[2023-11-10 11:55:34,410 INFO  L281   CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places.
[2023-11-10 11:55:34,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 109 transitions, 238 flow
[2023-11-10 11:55:34,411 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,411 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:34,411 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:34,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-10 11:55:34,411 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:34,412 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:34,412 INFO  L85        PathProgramCache]: Analyzing trace with hash -917564126, now seen corresponding path program 1 times
[2023-11-10 11:55:34,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:34,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704761363]
[2023-11-10 11:55:34,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:34,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:34,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:34,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:34,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:34,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704761363]
[2023-11-10 11:55:34,539 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704761363] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-10 11:55:34,539 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827394481]
[2023-11-10 11:55:34,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:34,540 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:34,540 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:34,543 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-10 11:55:34,544 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-10 11:55:34,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:34,627 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-10 11:55:34,629 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-11-10 11:55:34,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-10 11:55:34,668 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-10 11:55:34,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827394481] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:34,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-10 11:55:34,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2023-11-10 11:55:34,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197347736]
[2023-11-10 11:55:34,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:34,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:34,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:34,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:34,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:55:34,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 153
[2023-11-10 11:55:34,672 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 109 transitions, 238 flow. Second operand  has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:34,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 153
[2023-11-10 11:55:34,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:34,726 INFO  L124   PetriNetUnfolderBase]: 0/139 cut-off events.
[2023-11-10 11:55:34,726 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2023-11-10 11:55:34,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 166 conditions, 139 events. 0/139 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 248 event pairs, 0 based on Foata normal form. 2/139 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. 
[2023-11-10 11:55:34,727 INFO  L140   encePairwiseOnDemand]: 151/153 looper letters, 6 selfloop transitions, 0 changer transitions 1/109 dead transitions.
[2023-11-10 11:55:34,727 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 252 flow
[2023-11-10 11:55:34,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:34,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:34,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions.
[2023-11-10 11:55:34,729 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8148148148148148
[2023-11-10 11:55:34,729 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 374 transitions.
[2023-11-10 11:55:34,729 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions.
[2023-11-10 11:55:34,729 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:34,729 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions.
[2023-11-10 11:55:34,731 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,733 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,733 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,734 INFO  L175             Difference]: Start difference. First operand has 138 places, 109 transitions, 238 flow. Second operand 3 states and 374 transitions.
[2023-11-10 11:55:34,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 252 flow
[2023-11-10 11:55:34,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-10 11:55:34,737 INFO  L231             Difference]: Finished difference. Result has 117 places, 108 transitions, 236 flow
[2023-11-10 11:55:34,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=117, PETRI_TRANSITIONS=108}
[2023-11-10 11:55:34,740 INFO  L281   CegarLoopForPetriNet]: 136 programPoint places, -19 predicate places.
[2023-11-10 11:55:34,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 236 flow
[2023-11-10 11:55:34,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:34,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:34,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:34,748 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-11-10 11:55:34,945 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:34,946 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:34,946 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:34,946 INFO  L85        PathProgramCache]: Analyzing trace with hash -1022966814, now seen corresponding path program 1 times
[2023-11-10 11:55:34,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:34,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524418303]
[2023-11-10 11:55:34,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:34,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:34,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:34,982 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-10 11:55:34,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:35,000 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-10 11:55:35,001 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-10 11:55:35,001 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining)
[2023-11-10 11:55:35,001 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining)
[2023-11-10 11:55:35,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-10 11:55:35,002 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-11-10 11:55:35,002 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-10 11:55:35,002 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-10 11:55:35,047 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-10 11:55:35,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 161 places, 183 transitions, 393 flow
[2023-11-10 11:55:35,096 INFO  L124   PetriNetUnfolderBase]: 62/411 cut-off events.
[2023-11-10 11:55:35,096 INFO  L125   PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES.
[2023-11-10 11:55:35,098 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 436 conditions, 411 events. 62/411 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1341 event pairs, 1 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 281. Up to 16 conditions per place. 
[2023-11-10 11:55:35,098 INFO  L82        GeneralOperation]: Start removeDead. Operand has 161 places, 183 transitions, 393 flow
[2023-11-10 11:55:35,102 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 161 places, 183 transitions, 393 flow
[2023-11-10 11:55:35,107 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-10 11:55:35,112 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;@2969cd33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-10 11:55:35,112 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2023-11-10 11:55:35,121 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-10 11:55:35,121 INFO  L124   PetriNetUnfolderBase]: 8/102 cut-off events.
[2023-11-10 11:55:35,121 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:55:35,121 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:35,121 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:35,121 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:35,122 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:35,122 INFO  L85        PathProgramCache]: Analyzing trace with hash 742756828, now seen corresponding path program 1 times
[2023-11-10 11:55:35,122 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:35,122 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146942854]
[2023-11-10 11:55:35,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:35,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:35,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:35,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:35,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:35,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146942854]
[2023-11-10 11:55:35,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146942854] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:35,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:55:35,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-10 11:55:35,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672483421]
[2023-11-10 11:55:35,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:35,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:35,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:35,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:35,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-10 11:55:35,187 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 183
[2023-11-10 11:55:35,187 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 183 transitions, 393 flow. Second operand  has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,187 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:35,187 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 183
[2023-11-10 11:55:35,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:35,264 INFO  L124   PetriNetUnfolderBase]: 16/338 cut-off events.
[2023-11-10 11:55:35,264 INFO  L125   PetriNetUnfolderBase]: For 57/110 co-relation queries the response was YES.
[2023-11-10 11:55:35,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 409 conditions, 338 events. 16/338 cut-off events. For 57/110 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1102 event pairs, 1 based on Foata normal form. 292/607 useless extension candidates. Maximal degree in co-relation 250. Up to 41 conditions per place. 
[2023-11-10 11:55:35,265 INFO  L140   encePairwiseOnDemand]: 157/183 looper letters, 13 selfloop transitions, 2 changer transitions 28/163 dead transitions.
[2023-11-10 11:55:35,266 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 163 transitions, 391 flow
[2023-11-10 11:55:35,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:35,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:35,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions.
[2023-11-10 11:55:35,267 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8779599271402551
[2023-11-10 11:55:35,267 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 482 transitions.
[2023-11-10 11:55:35,267 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions.
[2023-11-10 11:55:35,268 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:35,268 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions.
[2023-11-10 11:55:35,269 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,270 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,270 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,270 INFO  L175             Difference]: Start difference. First operand has 161 places, 183 transitions, 393 flow. Second operand 3 states and 482 transitions.
[2023-11-10 11:55:35,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 163 transitions, 391 flow
[2023-11-10 11:55:35,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 163 transitions, 391 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-10 11:55:35,278 INFO  L231             Difference]: Finished difference. Result has 163 places, 132 transitions, 292 flow
[2023-11-10 11:55:35,278 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=163, PETRI_TRANSITIONS=132}
[2023-11-10 11:55:35,280 INFO  L281   CegarLoopForPetriNet]: 161 programPoint places, 2 predicate places.
[2023-11-10 11:55:35,280 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 132 transitions, 292 flow
[2023-11-10 11:55:35,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:35,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:35,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-10 11:55:35,281 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:35,281 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:35,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 1393093525, now seen corresponding path program 1 times
[2023-11-10 11:55:35,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:35,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145748392]
[2023-11-10 11:55:35,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:35,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:35,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:35,368 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:35,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:35,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145748392]
[2023-11-10 11:55:35,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145748392] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-10 11:55:35,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599476136]
[2023-11-10 11:55:35,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:35,369 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:35,369 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:35,376 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-10 11:55:35,415 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-10 11:55:35,472 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:35,473 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-10 11:55:35,476 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-11-10 11:55:35,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-10 11:55:35,497 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-10 11:55:35,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599476136] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:35,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-10 11:55:35,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2023-11-10 11:55:35,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075117022]
[2023-11-10 11:55:35,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:35,500 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:35,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:35,502 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:35,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:55:35,506 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 183
[2023-11-10 11:55:35,506 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 132 transitions, 292 flow. Second operand  has 3 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-10 11:55:35,506 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:35,506 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 183
[2023-11-10 11:55:35,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:35,539 INFO  L124   PetriNetUnfolderBase]: 0/188 cut-off events.
[2023-11-10 11:55:35,539 INFO  L125   PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES.
[2023-11-10 11:55:35,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 226 conditions, 188 events. 0/188 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 434 event pairs, 0 based on Foata normal form. 3/188 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. 
[2023-11-10 11:55:35,540 INFO  L140   encePairwiseOnDemand]: 181/183 looper letters, 7 selfloop transitions, 0 changer transitions 1/132 dead transitions.
[2023-11-10 11:55:35,540 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 132 transitions, 308 flow
[2023-11-10 11:55:35,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:35,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:35,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions.
[2023-11-10 11:55:35,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8032786885245902
[2023-11-10 11:55:35,542 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 441 transitions.
[2023-11-10 11:55:35,542 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions.
[2023-11-10 11:55:35,542 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:35,542 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions.
[2023-11-10 11:55:35,543 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,545 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,545 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:35,545 INFO  L175             Difference]: Start difference. First operand has 163 places, 132 transitions, 292 flow. Second operand 3 states and 441 transitions.
[2023-11-10 11:55:35,545 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 132 transitions, 308 flow
[2023-11-10 11:55:35,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 132 transitions, 304 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-10 11:55:35,548 INFO  L231             Difference]: Finished difference. Result has 142 places, 131 transitions, 288 flow
[2023-11-10 11:55:35,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=142, PETRI_TRANSITIONS=131}
[2023-11-10 11:55:35,549 INFO  L281   CegarLoopForPetriNet]: 161 programPoint places, -19 predicate places.
[2023-11-10 11:55:35,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 288 flow
[2023-11-10 11:55:35,550 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 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-10 11:55:35,550 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:35,550 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:35,557 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-10 11:55:35,754 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2023-11-10 11:55:35,755 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:35,755 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:35,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -629813943, now seen corresponding path program 1 times
[2023-11-10 11:55:35,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:35,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420547816]
[2023-11-10 11:55:35,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:35,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:35,767 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:35,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:35,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:35,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420547816]
[2023-11-10 11:55:35,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420547816] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-10 11:55:35,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760669135]
[2023-11-10 11:55:35,824 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:35,824 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:35,825 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:35,826 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-10 11:55:35,829 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-10 11:55:35,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:35,912 INFO  L262         TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-10 11:55:35,914 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-11-10 11:55:35,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:35,963 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-11-10 11:55:36,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:36,006 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760669135] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-10 11:55:36,006 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-10 11:55:36,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2023-11-10 11:55:36,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008704141]
[2023-11-10 11:55:36,007 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-10 11:55:36,007 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-10 11:55:36,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:36,008 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-10 11:55:36,008 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2023-11-10 11:55:36,010 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 183
[2023-11-10 11:55:36,012 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 288 flow. Second operand  has 10 states, 10 states have (on average 145.4) internal successors, (1454), 10 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,012 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:36,012 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 183
[2023-11-10 11:55:36,012 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:36,110 INFO  L124   PetriNetUnfolderBase]: 0/152 cut-off events.
[2023-11-10 11:55:36,110 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2023-11-10 11:55:36,110 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 198 conditions, 152 events. 0/152 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 211 event pairs, 0 based on Foata normal form. 2/154 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. 
[2023-11-10 11:55:36,111 INFO  L140   encePairwiseOnDemand]: 177/183 looper letters, 14 selfloop transitions, 9 changer transitions 0/141 dead transitions.
[2023-11-10 11:55:36,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 141 transitions, 356 flow
[2023-11-10 11:55:36,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-10 11:55:36,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-10 11:55:36,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1312 transitions.
[2023-11-10 11:55:36,114 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7965998785670917
[2023-11-10 11:55:36,115 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1312 transitions.
[2023-11-10 11:55:36,115 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1312 transitions.
[2023-11-10 11:55:36,115 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:36,116 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1312 transitions.
[2023-11-10 11:55:36,119 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 145.77777777777777) internal successors, (1312), 9 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,123 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,123 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,124 INFO  L175             Difference]: Start difference. First operand has 142 places, 131 transitions, 288 flow. Second operand 9 states and 1312 transitions.
[2023-11-10 11:55:36,124 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 141 transitions, 356 flow
[2023-11-10 11:55:36,125 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 141 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-10 11:55:36,127 INFO  L231             Difference]: Finished difference. Result has 151 places, 137 transitions, 336 flow
[2023-11-10 11:55:36,127 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=336, PETRI_PLACES=151, PETRI_TRANSITIONS=137}
[2023-11-10 11:55:36,128 INFO  L281   CegarLoopForPetriNet]: 161 programPoint places, -10 predicate places.
[2023-11-10 11:55:36,129 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 137 transitions, 336 flow
[2023-11-10 11:55:36,129 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 145.4) internal successors, (1454), 10 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,129 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:36,129 INFO  L208   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:36,137 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-11-10 11:55:36,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:36,334 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:36,335 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:36,335 INFO  L85        PathProgramCache]: Analyzing trace with hash -1269063128, now seen corresponding path program 1 times
[2023-11-10 11:55:36,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:36,335 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054604808]
[2023-11-10 11:55:36,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:36,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:36,356 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:36,359 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-10 11:55:36,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:36,410 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-10 11:55:36,410 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-10 11:55:36,411 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining)
[2023-11-10 11:55:36,411 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining)
[2023-11-10 11:55:36,411 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-10 11:55:36,411 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-10 11:55:36,412 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-10 11:55:36,412 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-10 11:55:36,444 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-11-10 11:55:36,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 186 places, 213 transitions, 466 flow
[2023-11-10 11:55:36,536 INFO  L124   PetriNetUnfolderBase]: 96/621 cut-off events.
[2023-11-10 11:55:36,536 INFO  L125   PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2023-11-10 11:55:36,542 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 672 conditions, 621 events. 96/621 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2362 event pairs, 6 based on Foata normal form. 0/520 useless extension candidates. Maximal degree in co-relation 431. Up to 32 conditions per place. 
[2023-11-10 11:55:36,542 INFO  L82        GeneralOperation]: Start removeDead. Operand has 186 places, 213 transitions, 466 flow
[2023-11-10 11:55:36,548 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 186 places, 213 transitions, 466 flow
[2023-11-10 11:55:36,550 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-10 11:55:36,551 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;@2969cd33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-10 11:55:36,551 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2023-11-10 11:55:36,560 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-10 11:55:36,560 INFO  L124   PetriNetUnfolderBase]: 8/102 cut-off events.
[2023-11-10 11:55:36,560 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:55:36,560 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:36,560 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:36,561 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:36,561 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:36,561 INFO  L85        PathProgramCache]: Analyzing trace with hash -965078095, now seen corresponding path program 1 times
[2023-11-10 11:55:36,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:36,561 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858041019]
[2023-11-10 11:55:36,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:36,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:36,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:36,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:36,611 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:36,611 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858041019]
[2023-11-10 11:55:36,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858041019] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:36,611 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:55:36,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-10 11:55:36,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305445628]
[2023-11-10 11:55:36,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:36,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:36,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:36,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:36,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-10 11:55:36,614 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 213
[2023-11-10 11:55:36,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 213 transitions, 466 flow. Second operand  has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:36,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 213
[2023-11-10 11:55:36,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:36,727 INFO  L124   PetriNetUnfolderBase]: 32/529 cut-off events.
[2023-11-10 11:55:36,727 INFO  L125   PetriNetUnfolderBase]: For 112/168 co-relation queries the response was YES.
[2023-11-10 11:55:36,730 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 661 conditions, 529 events. 32/529 cut-off events. For 112/168 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2137 event pairs, 6 based on Foata normal form. 665/1158 useless extension candidates. Maximal degree in co-relation 405. Up to 76 conditions per place. 
[2023-11-10 11:55:36,731 INFO  L140   encePairwiseOnDemand]: 181/213 looper letters, 14 selfloop transitions, 2 changer transitions 29/187 dead transitions.
[2023-11-10 11:55:36,731 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 187 transitions, 456 flow
[2023-11-10 11:55:36,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:36,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:36,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions.
[2023-11-10 11:55:36,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8701095461658842
[2023-11-10 11:55:36,733 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 556 transitions.
[2023-11-10 11:55:36,733 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions.
[2023-11-10 11:55:36,734 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:36,734 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions.
[2023-11-10 11:55:36,735 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,736 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,736 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,736 INFO  L175             Difference]: Start difference. First operand has 186 places, 213 transitions, 466 flow. Second operand 3 states and 556 transitions.
[2023-11-10 11:55:36,736 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 187 transitions, 456 flow
[2023-11-10 11:55:36,739 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 187 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-10 11:55:36,741 INFO  L231             Difference]: Finished difference. Result has 188 places, 155 transitions, 348 flow
[2023-11-10 11:55:36,741 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=188, PETRI_TRANSITIONS=155}
[2023-11-10 11:55:36,742 INFO  L281   CegarLoopForPetriNet]: 186 programPoint places, 2 predicate places.
[2023-11-10 11:55:36,742 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 155 transitions, 348 flow
[2023-11-10 11:55:36,742 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,742 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:36,742 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:36,742 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-10 11:55:36,743 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:36,743 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:36,743 INFO  L85        PathProgramCache]: Analyzing trace with hash -490304154, now seen corresponding path program 1 times
[2023-11-10 11:55:36,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:36,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825485481]
[2023-11-10 11:55:36,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:36,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:36,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:36,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:36,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:36,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825485481]
[2023-11-10 11:55:36,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825485481] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-10 11:55:36,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824455523]
[2023-11-10 11:55:36,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:36,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:36,812 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:36,813 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-10 11:55:36,841 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-10 11:55:36,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:36,909 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-10 11:55:36,912 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-11-10 11:55:36,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-10 11:55:36,924 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-10 11:55:36,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [824455523] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:36,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-10 11:55:36,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2023-11-10 11:55:36,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075343659]
[2023-11-10 11:55:36,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:36,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:36,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:36,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:36,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:55:36,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 213
[2023-11-10 11:55:36,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 155 transitions, 348 flow. Second operand  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:36,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 213
[2023-11-10 11:55:36,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:36,969 INFO  L124   PetriNetUnfolderBase]: 0/237 cut-off events.
[2023-11-10 11:55:36,970 INFO  L125   PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES.
[2023-11-10 11:55:36,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 287 conditions, 237 events. 0/237 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 618 event pairs, 0 based on Foata normal form. 4/237 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. 
[2023-11-10 11:55:36,971 INFO  L140   encePairwiseOnDemand]: 211/213 looper letters, 8 selfloop transitions, 0 changer transitions 1/155 dead transitions.
[2023-11-10 11:55:36,971 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 155 transitions, 366 flow
[2023-11-10 11:55:36,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:36,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:36,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions.
[2023-11-10 11:55:36,973 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7949921752738655
[2023-11-10 11:55:36,973 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 508 transitions.
[2023-11-10 11:55:36,973 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions.
[2023-11-10 11:55:36,973 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:36,973 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions.
[2023-11-10 11:55:36,974 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,975 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,976 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 213.0) internal successors, (852), 4 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,976 INFO  L175             Difference]: Start difference. First operand has 188 places, 155 transitions, 348 flow. Second operand 3 states and 508 transitions.
[2023-11-10 11:55:36,976 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 155 transitions, 366 flow
[2023-11-10 11:55:36,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 155 transitions, 358 flow, removed 3 selfloop flow, removed 1 redundant places.
[2023-11-10 11:55:36,979 INFO  L231             Difference]: Finished difference. Result has 167 places, 154 transitions, 340 flow
[2023-11-10 11:55:36,979 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=154}
[2023-11-10 11:55:36,980 INFO  L281   CegarLoopForPetriNet]: 186 programPoint places, -19 predicate places.
[2023-11-10 11:55:36,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 340 flow
[2023-11-10 11:55:36,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:36,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:36,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:36,987 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-11-10 11:55:37,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:37,185 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:37,186 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:37,186 INFO  L85        PathProgramCache]: Analyzing trace with hash 1901222266, now seen corresponding path program 1 times
[2023-11-10 11:55:37,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:37,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545257318]
[2023-11-10 11:55:37,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:37,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:37,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:37,242 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:37,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:37,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545257318]
[2023-11-10 11:55:37,243 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545257318] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-10 11:55:37,243 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938773847]
[2023-11-10 11:55:37,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:37,243 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:37,244 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:37,245 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-10 11:55:37,247 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-11-10 11:55:37,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:37,331 INFO  L262         TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-10 11:55:37,333 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-11-10 11:55:37,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:37,356 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-11-10 11:55:37,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:37,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [938773847] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-10 11:55:37,386 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-10 11:55:37,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2023-11-10 11:55:37,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626761091]
[2023-11-10 11:55:37,387 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-10 11:55:37,387 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-10 11:55:37,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:37,388 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-10 11:55:37,388 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2023-11-10 11:55:37,389 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 213
[2023-11-10 11:55:37,391 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 340 flow. Second operand  has 10 states, 10 states have (on average 167.4) internal successors, (1674), 10 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:37,391 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:37,391 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 213
[2023-11-10 11:55:37,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:37,469 INFO  L124   PetriNetUnfolderBase]: 0/199 cut-off events.
[2023-11-10 11:55:37,470 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2023-11-10 11:55:37,470 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 260 conditions, 199 events. 0/199 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 379 event pairs, 0 based on Foata normal form. 2/201 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. 
[2023-11-10 11:55:37,470 INFO  L140   encePairwiseOnDemand]: 207/213 looper letters, 15 selfloop transitions, 9 changer transitions 0/164 dead transitions.
[2023-11-10 11:55:37,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 164 transitions, 410 flow
[2023-11-10 11:55:37,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-10 11:55:37,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-10 11:55:37,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1511 transitions.
[2023-11-10 11:55:37,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7882107459572248
[2023-11-10 11:55:37,475 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1511 transitions.
[2023-11-10 11:55:37,475 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1511 transitions.
[2023-11-10 11:55:37,475 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:37,476 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1511 transitions.
[2023-11-10 11:55:37,478 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 167.88888888888889) internal successors, (1511), 9 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:37,481 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:37,482 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 213.0) internal successors, (2130), 10 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:37,482 INFO  L175             Difference]: Start difference. First operand has 167 places, 154 transitions, 340 flow. Second operand 9 states and 1511 transitions.
[2023-11-10 11:55:37,482 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 164 transitions, 410 flow
[2023-11-10 11:55:37,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 164 transitions, 408 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-10 11:55:37,486 INFO  L231             Difference]: Finished difference. Result has 176 places, 160 transitions, 388 flow
[2023-11-10 11:55:37,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=388, PETRI_PLACES=176, PETRI_TRANSITIONS=160}
[2023-11-10 11:55:37,487 INFO  L281   CegarLoopForPetriNet]: 186 programPoint places, -10 predicate places.
[2023-11-10 11:55:37,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 160 transitions, 388 flow
[2023-11-10 11:55:37,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 167.4) internal successors, (1674), 10 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:37,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:37,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:37,498 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-11-10 11:55:37,698 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-11-10 11:55:37,699 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:37,699 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:37,699 INFO  L85        PathProgramCache]: Analyzing trace with hash 1664894469, now seen corresponding path program 1 times
[2023-11-10 11:55:37,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:37,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364836700]
[2023-11-10 11:55:37,699 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:37,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:37,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:37,716 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-10 11:55:37,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:55:37,733 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-10 11:55:37,734 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-10 11:55:37,734 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining)
[2023-11-10 11:55:37,734 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining)
[2023-11-10 11:55:37,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-10 11:55:37,734 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-10 11:55:37,735 WARN  L233   ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-10 11:55:37,735 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances.
[2023-11-10 11:55:37,760 INFO  L144    ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions.
[2023-11-10 11:55:37,762 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 211 places, 243 transitions, 541 flow
[2023-11-10 11:55:37,897 INFO  L124   PetriNetUnfolderBase]: 158/979 cut-off events.
[2023-11-10 11:55:37,898 INFO  L125   PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES.
[2023-11-10 11:55:37,908 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 979 events. 158/979 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4406 event pairs, 23 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 666. Up to 80 conditions per place. 
[2023-11-10 11:55:37,908 INFO  L82        GeneralOperation]: Start removeDead. Operand has 211 places, 243 transitions, 541 flow
[2023-11-10 11:55:37,917 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 211 places, 243 transitions, 541 flow
[2023-11-10 11:55:37,918 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-10 11:55:37,919 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;@2969cd33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-10 11:55:37,919 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 2 error locations.
[2023-11-10 11:55:37,924 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-10 11:55:37,924 INFO  L124   PetriNetUnfolderBase]: 8/100 cut-off events.
[2023-11-10 11:55:37,924 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:55:37,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:37,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:37,925 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:37,925 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:37,925 INFO  L85        PathProgramCache]: Analyzing trace with hash 1381514148, now seen corresponding path program 1 times
[2023-11-10 11:55:37,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:37,925 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359271237]
[2023-11-10 11:55:37,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:37,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:37,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:37,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:37,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:37,954 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359271237]
[2023-11-10 11:55:37,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359271237] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:37,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:55:37,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-10 11:55:37,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030990002]
[2023-11-10 11:55:37,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:37,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:37,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:37,955 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:37,955 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-10 11:55:37,956 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 243
[2023-11-10 11:55:37,956 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 243 transitions, 541 flow. Second operand  has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:37,957 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:37,957 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 243
[2023-11-10 11:55:37,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:38,140 INFO  L124   PetriNetUnfolderBase]: 68/860 cut-off events.
[2023-11-10 11:55:38,140 INFO  L125   PetriNetUnfolderBase]: For 270/343 co-relation queries the response was YES.
[2023-11-10 11:55:38,146 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 860 events. 68/860 cut-off events. For 270/343 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4195 event pairs, 23 based on Foata normal form. 1422/2225 useless extension candidates. Maximal degree in co-relation 657. Up to 147 conditions per place. 
[2023-11-10 11:55:38,147 INFO  L140   encePairwiseOnDemand]: 205/243 looper letters, 15 selfloop transitions, 2 changer transitions 30/211 dead transitions.
[2023-11-10 11:55:38,147 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 211 transitions, 523 flow
[2023-11-10 11:55:38,148 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:38,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:38,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions.
[2023-11-10 11:55:38,149 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8641975308641975
[2023-11-10 11:55:38,149 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 630 transitions.
[2023-11-10 11:55:38,149 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions.
[2023-11-10 11:55:38,150 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:38,150 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions.
[2023-11-10 11:55:38,151 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,152 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,153 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,154 INFO  L175             Difference]: Start difference. First operand has 211 places, 243 transitions, 541 flow. Second operand 3 states and 630 transitions.
[2023-11-10 11:55:38,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 211 transitions, 523 flow
[2023-11-10 11:55:38,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 211 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-10 11:55:38,161 INFO  L231             Difference]: Finished difference. Result has 213 places, 178 transitions, 406 flow
[2023-11-10 11:55:38,162 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=213, PETRI_TRANSITIONS=178}
[2023-11-10 11:55:38,163 INFO  L281   CegarLoopForPetriNet]: 211 programPoint places, 2 predicate places.
[2023-11-10 11:55:38,163 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 178 transitions, 406 flow
[2023-11-10 11:55:38,163 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,163 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:38,163 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:38,163 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-10 11:55:38,164 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:38,164 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:38,164 INFO  L85        PathProgramCache]: Analyzing trace with hash 2022177429, now seen corresponding path program 1 times
[2023-11-10 11:55:38,164 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:38,164 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68619247]
[2023-11-10 11:55:38,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:38,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:38,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:38,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:38,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:38,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68619247]
[2023-11-10 11:55:38,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68619247] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-10 11:55:38,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205140572]
[2023-11-10 11:55:38,226 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:38,227 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:38,227 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:38,228 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-10 11:55:38,230 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-11-10 11:55:38,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:38,318 INFO  L262         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-10 11:55:38,319 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-11-10 11:55:38,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-10 11:55:38,330 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-10 11:55:38,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205140572] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:38,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-10 11:55:38,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6
[2023-11-10 11:55:38,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356281383]
[2023-11-10 11:55:38,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:38,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:55:38,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:38,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:55:38,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:55:38,332 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 243
[2023-11-10 11:55:38,333 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 178 transitions, 406 flow. Second operand  has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,333 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:38,333 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 243
[2023-11-10 11:55:38,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:38,385 INFO  L124   PetriNetUnfolderBase]: 0/286 cut-off events.
[2023-11-10 11:55:38,385 INFO  L125   PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES.
[2023-11-10 11:55:38,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 349 conditions, 286 events. 0/286 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 806 event pairs, 0 based on Foata normal form. 5/286 useless extension candidates. Maximal degree in co-relation 0. Up to 18 conditions per place. 
[2023-11-10 11:55:38,386 INFO  L140   encePairwiseOnDemand]: 241/243 looper letters, 9 selfloop transitions, 0 changer transitions 1/178 dead transitions.
[2023-11-10 11:55:38,386 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 178 transitions, 426 flow
[2023-11-10 11:55:38,387 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:55:38,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:55:38,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 575 transitions.
[2023-11-10 11:55:38,388 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7887517146776406
[2023-11-10 11:55:38,388 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 575 transitions.
[2023-11-10 11:55:38,388 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 575 transitions.
[2023-11-10 11:55:38,389 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:38,389 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 575 transitions.
[2023-11-10 11:55:38,390 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,391 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,392 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,392 INFO  L175             Difference]: Start difference. First operand has 213 places, 178 transitions, 406 flow. Second operand 3 states and 575 transitions.
[2023-11-10 11:55:38,392 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 178 transitions, 426 flow
[2023-11-10 11:55:38,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 178 transitions, 412 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-11-10 11:55:38,395 INFO  L231             Difference]: Finished difference. Result has 192 places, 177 transitions, 392 flow
[2023-11-10 11:55:38,395 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=192, PETRI_TRANSITIONS=177}
[2023-11-10 11:55:38,396 INFO  L281   CegarLoopForPetriNet]: 211 programPoint places, -19 predicate places.
[2023-11-10 11:55:38,396 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 177 transitions, 392 flow
[2023-11-10 11:55:38,396 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,396 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:38,397 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:38,408 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-11-10 11:55:38,601 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-11-10 11:55:38,601 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:38,602 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:38,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -1670556343, now seen corresponding path program 1 times
[2023-11-10 11:55:38,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:38,602 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486183978]
[2023-11-10 11:55:38,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:38,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:38,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:38,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:38,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:38,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486183978]
[2023-11-10 11:55:38,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486183978] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-10 11:55:38,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207773553]
[2023-11-10 11:55:38,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:38,666 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:38,666 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:55:38,667 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-10 11:55:38,670 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-11-10 11:55:38,771 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:38,771 INFO  L262         TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-11-10 11:55:38,772 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-11-10 11:55:38,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:38,807 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-11-10 11:55:38,835 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-10 11:55:38,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207773553] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-10 11:55:38,835 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-10 11:55:38,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10
[2023-11-10 11:55:38,836 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255773816]
[2023-11-10 11:55:38,836 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-10 11:55:38,836 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-11-10 11:55:38,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:38,837 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-11-10 11:55:38,837 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2023-11-10 11:55:38,838 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 243
[2023-11-10 11:55:38,840 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 177 transitions, 392 flow. Second operand  has 10 states, 10 states have (on average 189.4) internal successors, (1894), 10 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,840 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:38,840 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 243
[2023-11-10 11:55:38,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:55:38,931 INFO  L124   PetriNetUnfolderBase]: 0/246 cut-off events.
[2023-11-10 11:55:38,931 INFO  L125   PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES.
[2023-11-10 11:55:38,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 322 conditions, 246 events. 0/246 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 546 event pairs, 0 based on Foata normal form. 2/248 useless extension candidates. Maximal degree in co-relation 0. Up to 15 conditions per place. 
[2023-11-10 11:55:38,932 INFO  L140   encePairwiseOnDemand]: 237/243 looper letters, 16 selfloop transitions, 9 changer transitions 0/187 dead transitions.
[2023-11-10 11:55:38,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 187 transitions, 464 flow
[2023-11-10 11:55:38,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-10 11:55:38,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-10 11:55:38,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1710 transitions.
[2023-11-10 11:55:38,935 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7818930041152263
[2023-11-10 11:55:38,936 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1710 transitions.
[2023-11-10 11:55:38,936 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1710 transitions.
[2023-11-10 11:55:38,936 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:55:38,937 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1710 transitions.
[2023-11-10 11:55:38,940 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,943 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,943 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,944 INFO  L175             Difference]: Start difference. First operand has 192 places, 177 transitions, 392 flow. Second operand 9 states and 1710 transitions.
[2023-11-10 11:55:38,944 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 187 transitions, 464 flow
[2023-11-10 11:55:38,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 187 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-10 11:55:38,947 INFO  L231             Difference]: Finished difference. Result has 201 places, 183 transitions, 440 flow
[2023-11-10 11:55:38,947 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=440, PETRI_PLACES=201, PETRI_TRANSITIONS=183}
[2023-11-10 11:55:38,948 INFO  L281   CegarLoopForPetriNet]: 211 programPoint places, -10 predicate places.
[2023-11-10 11:55:38,948 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 183 transitions, 440 flow
[2023-11-10 11:55:38,948 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 189.4) internal successors, (1894), 10 states have internal predecessors, (1894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:38,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:55:38,949 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:55:38,955 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-11-10 11:55:39,153 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-10 11:55:39,154 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:55:39,154 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:55:39,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 1539467822, now seen corresponding path program 1 times
[2023-11-10 11:55:39,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:55:39,154 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577486743]
[2023-11-10 11:55:39,154 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:55:39,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:55:39,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:55:39,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2023-11-10 11:55:39,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:55:39,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577486743]
[2023-11-10 11:55:39,275 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577486743] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:55:39,275 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:55:39,275 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-10 11:55:39,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632261112]
[2023-11-10 11:55:39,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:55:39,275 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-10 11:55:39,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:55:39,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-10 11:55:39,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-10 11:55:39,277 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 243
[2023-11-10 11:55:39,278 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 183 transitions, 440 flow. Second operand  has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:55:39,278 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:55:39,278 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 243
[2023-11-10 11:55:39,278 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:56:08,664 INFO  L124   PetriNetUnfolderBase]: 110509/240135 cut-off events.
[2023-11-10 11:56:08,664 INFO  L125   PetriNetUnfolderBase]: For 2864/2864 co-relation queries the response was YES.
[2023-11-10 11:56:10,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 384362 conditions, 240135 events. 110509/240135 cut-off events. For 2864/2864 co-relation queries the response was YES. Maximal size of possible extension queue 8691. Compared 3223358 event pairs, 76730 based on Foata normal form. 3875/241133 useless extension candidates. Maximal degree in co-relation 384350. Up to 88950 conditions per place. 
[2023-11-10 11:56:11,148 INFO  L140   encePairwiseOnDemand]: 234/243 looper letters, 38 selfloop transitions, 6 changer transitions 65/262 dead transitions.
[2023-11-10 11:56:11,148 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 262 transitions, 836 flow
[2023-11-10 11:56:11,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-10 11:56:11,149 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-10 11:56:11,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1294 transitions.
[2023-11-10 11:56:11,151 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7607289829512052
[2023-11-10 11:56:11,151 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1294 transitions.
[2023-11-10 11:56:11,151 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1294 transitions.
[2023-11-10 11:56:11,152 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:56:11,152 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1294 transitions.
[2023-11-10 11:56:11,156 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 184.85714285714286) internal successors, (1294), 7 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:56:11,159 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:56:11,159 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:56:11,159 INFO  L175             Difference]: Start difference. First operand has 201 places, 183 transitions, 440 flow. Second operand 7 states and 1294 transitions.
[2023-11-10 11:56:11,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 262 transitions, 836 flow
[2023-11-10 11:56:11,167 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 262 transitions, 830 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-10 11:56:11,169 INFO  L231             Difference]: Finished difference. Result has 211 places, 188 transitions, 502 flow
[2023-11-10 11:56:11,170 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=211, PETRI_TRANSITIONS=188}
[2023-11-10 11:56:11,170 INFO  L281   CegarLoopForPetriNet]: 211 programPoint places, 0 predicate places.
[2023-11-10 11:56:11,170 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 188 transitions, 502 flow
[2023-11-10 11:56:11,171 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:56:11,171 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:56:11,171 INFO  L208   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:56:11,171 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-10 11:56:11,171 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-11-10 11:56:11,172 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:56:11,172 INFO  L85        PathProgramCache]: Analyzing trace with hash -987371113, now seen corresponding path program 1 times
[2023-11-10 11:56:11,172 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:56:11,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656259680]
[2023-11-10 11:56:11,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:56:11,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:56:11,189 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:56:11,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2023-11-10 11:56:11,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:56:11,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656259680]
[2023-11-10 11:56:11,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656259680] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:56:11,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:56:11,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-10 11:56:11,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357248363]
[2023-11-10 11:56:11,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:56:11,379 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-10 11:56:11,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:56:11,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-10 11:56:11,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:56:11,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 243
[2023-11-10 11:56:11,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 188 transitions, 502 flow. Second operand  has 6 states, 6 states have (on average 154.16666666666666) internal successors, (925), 6 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:56:11,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:56:11,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 243
[2023-11-10 11:56:11,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand