/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:52:45,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:52:46,010 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-12-09 14:52:46,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:52:46,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:52:46,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:52:46,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:52:46,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:52:46,039 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:52:46,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:52:46,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:52:46,043 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:52:46,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:52:46,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:52:46,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:52:46,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:52:46,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:52:46,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:52:46,045 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:52:46,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:52:46,045 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:52:46,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:52:46,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:52:46,046 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:52:46,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:52:46,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:52:46,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:52:46,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:52:46,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:52:46,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:52:46,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:52:46,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:52:46,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:52:46,048 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 14:52:46,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:52:46,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:52:46,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:52:46,271 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:52:46,272 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:52:46,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i [2023-12-09 14:52:47,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:52:47,589 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:52:47,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i [2023-12-09 14:52:47,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ee19e05/c65355683a804bd792e7a3869eb897bf/FLAG73d326086 [2023-12-09 14:52:47,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ee19e05/c65355683a804bd792e7a3869eb897bf [2023-12-09 14:52:47,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:52:47,622 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:52:47,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:52:47,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:52:47,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:52:47,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:47,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b19bb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47, skipping insertion in model container [2023-12-09 14:52:47,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:47,667 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:52:47,903 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i[30427,30440] [2023-12-09 14:52:47,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:52:47,919 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:52:47,960 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i[30427,30440] [2023-12-09 14:52:47,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:52:47,985 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:52:47,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47 WrapperNode [2023-12-09 14:52:47,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:52:47,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:52:47,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:52:47,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:52:47,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,017 INFO L138 Inliner]: procedures = 162, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2023-12-09 14:52:48,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:52:48,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:52:48,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:52:48,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:52:48,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:52:48,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:52:48,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:52:48,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:52:48,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (1/1) ... [2023-12-09 14:52:48,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:52:48,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:52:48,068 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-12-09 14:52:48,084 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-12-09 14:52:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-09 14:52:48,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-09 14:52:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:52:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 14:52:48,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:52:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:52:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:52:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:52:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 14:52:48,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:52:48,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:52:48,101 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 14:52:48,184 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:52:48,185 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:52:48,271 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:52:48,285 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:52:48,285 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-09 14:52:48,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:52:48 BoogieIcfgContainer [2023-12-09 14:52:48,286 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:52:48,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:52:48,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:52:48,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:52:48,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:52:47" (1/3) ... [2023-12-09 14:52:48,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7460b3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:52:48, skipping insertion in model container [2023-12-09 14:52:48,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:52:47" (2/3) ... [2023-12-09 14:52:48,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7460b3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:52:48, skipping insertion in model container [2023-12-09 14:52:48,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:52:48" (3/3) ... [2023-12-09 14:52:48,293 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003-pthread.i [2023-12-09 14:52:48,310 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:52:48,311 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 14:52:48,311 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:52:48,356 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:52:48,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 46 transitions, 96 flow [2023-12-09 14:52:48,425 INFO L124 PetriNetUnfolderBase]: 3/57 cut-off events. [2023-12-09 14:52:48,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:52:48,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 57 events. 3/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2023-12-09 14:52:48,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 46 transitions, 96 flow [2023-12-09 14:52:48,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 46 transitions, 96 flow [2023-12-09 14:52:48,437 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:52:48,442 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2e244faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:52:48,442 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 14:52:48,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:52:48,451 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2023-12-09 14:52:48,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:52:48,456 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:48,457 INFO L233 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] [2023-12-09 14:52:48,458 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:52:48,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash -960103673, now seen corresponding path program 1 times [2023-12-09 14:52:48,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:48,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345196347] [2023-12-09 14:52:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:48,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:48,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345196347] [2023-12-09 14:52:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345196347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22465818] [2023-12-09 14:52:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:48,748 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:48,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:48,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:48,779 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 46 [2023-12-09 14:52:48,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-12-09 14:52:48,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:48,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 46 [2023-12-09 14:52:48,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:48,817 INFO L124 PetriNetUnfolderBase]: 0/39 cut-off events. [2023-12-09 14:52:48,817 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:52:48,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 39 events. 0/39 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 13 event pairs, 0 based on Foata normal form. 7/46 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2023-12-09 14:52:48,818 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 4 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-12-09 14:52:48,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 88 flow [2023-12-09 14:52:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:48,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-12-09 14:52:48,831 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8260869565217391 [2023-12-09 14:52:48,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-12-09 14:52:48,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-12-09 14:52:48,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:48,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-12-09 14:52:48,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-12-09 14:52:48,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-12-09 14:52:48,842 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-12-09 14:52:48,847 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2023-12-09 14:52:48,847 INFO L500 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 88 flow [2023-12-09 14:52:48,847 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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-12-09 14:52:48,847 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:48,848 INFO L233 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] [2023-12-09 14:52:48,848 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:52:48,848 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-09 14:52:48,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1255567906, now seen corresponding path program 1 times [2023-12-09 14:52:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:48,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456166718] [2023-12-09 14:52:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:48,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:48,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:52:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:48,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:52:48,915 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:52:48,916 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-09 14:52:48,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-09 14:52:48,918 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-09 14:52:48,918 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:52:48,919 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 14:52:48,921 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:52:48,921 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 14:52:48,953 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:52:48,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 61 transitions, 132 flow [2023-12-09 14:52:48,967 INFO L124 PetriNetUnfolderBase]: 5/85 cut-off events. [2023-12-09 14:52:48,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:52:48,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 85 events. 5/85 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 136 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 58. Up to 6 conditions per place. [2023-12-09 14:52:48,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 61 transitions, 132 flow [2023-12-09 14:52:48,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 61 transitions, 132 flow [2023-12-09 14:52:48,970 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:52:48,971 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2e244faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:52:48,971 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 14:52:48,977 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:52:48,978 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2023-12-09 14:52:48,978 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:52:48,978 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:48,978 INFO L233 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] [2023-12-09 14:52:48,978 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:52:48,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1064745084, now seen corresponding path program 1 times [2023-12-09 14:52:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465414499] [2023-12-09 14:52:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:49,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:49,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465414499] [2023-12-09 14:52:49,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465414499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:49,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:49,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29542773] [2023-12-09 14:52:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:49,024 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:49,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:49,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:49,025 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 61 [2023-12-09 14:52:49,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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-12-09 14:52:49,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:49,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 61 [2023-12-09 14:52:49,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:49,073 INFO L124 PetriNetUnfolderBase]: 34/178 cut-off events. [2023-12-09 14:52:49,073 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-12-09 14:52:49,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 178 events. 34/178 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 658 event pairs, 13 based on Foata normal form. 63/237 useless extension candidates. Maximal degree in co-relation 127. Up to 69 conditions per place. [2023-12-09 14:52:49,075 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 21 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-12-09 14:52:49,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 189 flow [2023-12-09 14:52:49,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2023-12-09 14:52:49,076 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8524590163934426 [2023-12-09 14:52:49,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 156 transitions. [2023-12-09 14:52:49,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 156 transitions. [2023-12-09 14:52:49,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:49,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 156 transitions. [2023-12-09 14:52:49,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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-12-09 14:52:49,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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-12-09 14:52:49,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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-12-09 14:52:49,079 INFO L308 CegarLoopForPetriNet]: 63 programPoint places, -6 predicate places. [2023-12-09 14:52:49,079 INFO L500 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 189 flow [2023-12-09 14:52:49,080 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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-12-09 14:52:49,080 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:49,080 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:52:49,080 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:52:49,080 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-12-09 14:52:49,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -138081381, now seen corresponding path program 1 times [2023-12-09 14:52:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:49,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864557920] [2023-12-09 14:52:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:49,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:52:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:49,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:52:49,120 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:52:49,120 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-12-09 14:52:49,120 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-12-09 14:52:49,120 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-12-09 14:52:49,120 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-12-09 14:52:49,121 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:52:49,121 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 14:52:49,121 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:52:49,121 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 14:52:49,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:52:49,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 76 transitions, 170 flow [2023-12-09 14:52:49,171 INFO L124 PetriNetUnfolderBase]: 7/113 cut-off events. [2023-12-09 14:52:49,171 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-09 14:52:49,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 7/113 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 206 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 89. Up to 8 conditions per place. [2023-12-09 14:52:49,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 76 transitions, 170 flow [2023-12-09 14:52:49,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 76 transitions, 170 flow [2023-12-09 14:52:49,174 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:52:49,175 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2e244faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:52:49,175 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:52:49,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:52:49,180 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2023-12-09 14:52:49,180 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:52:49,180 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:49,180 INFO L233 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] [2023-12-09 14:52:49,181 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:52:49,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1029437186, now seen corresponding path program 1 times [2023-12-09 14:52:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094494974] [2023-12-09 14:52:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:49,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:49,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094494974] [2023-12-09 14:52:49,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094494974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807141289] [2023-12-09 14:52:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:49,267 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:49,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:49,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:49,270 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 76 [2023-12-09 14:52:49,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-12-09 14:52:49,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:49,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 76 [2023-12-09 14:52:49,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:49,540 INFO L124 PetriNetUnfolderBase]: 627/1540 cut-off events. [2023-12-09 14:52:49,541 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2023-12-09 14:52:49,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 1540 events. 627/1540 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10864 event pairs, 355 based on Foata normal form. 614/2105 useless extension candidates. Maximal degree in co-relation 2277. Up to 757 conditions per place. [2023-12-09 14:52:49,581 INFO L140 encePairwiseOnDemand]: 61/76 looper letters, 32 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2023-12-09 14:52:49,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 80 transitions, 268 flow [2023-12-09 14:52:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:49,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2023-12-09 14:52:49,586 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-12-09 14:52:49,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 190 transitions. [2023-12-09 14:52:49,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 190 transitions. [2023-12-09 14:52:49,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:49,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 190 transitions. [2023-12-09 14:52:49,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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-12-09 14:52:49,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 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-12-09 14:52:49,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 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-12-09 14:52:49,590 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2023-12-09 14:52:49,591 INFO L500 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 268 flow [2023-12-09 14:52:49,591 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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-12-09 14:52:49,591 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:49,591 INFO L233 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] [2023-12-09 14:52:49,591 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 14:52:49,592 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:52:49,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash 687498976, now seen corresponding path program 1 times [2023-12-09 14:52:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682483604] [2023-12-09 14:52:49,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:52:49,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682483604] [2023-12-09 14:52:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682483604] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:49,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840553692] [2023-12-09 14:52:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:49,689 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:49,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:49,691 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 76 [2023-12-09 14:52:49,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-12-09 14:52:49,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:49,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 76 [2023-12-09 14:52:49,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:49,730 INFO L124 PetriNetUnfolderBase]: 30/248 cut-off events. [2023-12-09 14:52:49,730 INFO L125 PetriNetUnfolderBase]: For 285/303 co-relation queries the response was YES. [2023-12-09 14:52:49,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 248 events. 30/248 cut-off events. For 285/303 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1213 event pairs, 3 based on Foata normal form. 59/303 useless extension candidates. Maximal degree in co-relation 173. Up to 91 conditions per place. [2023-12-09 14:52:49,732 INFO L140 encePairwiseOnDemand]: 70/76 looper letters, 13 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2023-12-09 14:52:49,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 248 flow [2023-12-09 14:52:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2023-12-09 14:52:49,734 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7850877192982456 [2023-12-09 14:52:49,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 179 transitions. [2023-12-09 14:52:49,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 179 transitions. [2023-12-09 14:52:49,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:49,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 179 transitions. [2023-12-09 14:52:49,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 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-12-09 14:52:49,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 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-12-09 14:52:49,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 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-12-09 14:52:49,738 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, -11 predicate places. [2023-12-09 14:52:49,738 INFO L500 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 248 flow [2023-12-09 14:52:49,739 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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-12-09 14:52:49,739 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:49,739 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:52:49,739 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 14:52:49,739 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-12-09 14:52:49,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -934056310, now seen corresponding path program 1 times [2023-12-09 14:52:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164945947] [2023-12-09 14:52:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:49,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:52:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:49,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:52:49,772 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:52:49,772 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-09 14:52:49,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:52:49,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-12-09 14:52:49,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-12-09 14:52:49,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:52:49,772 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 14:52:49,773 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:52:49,773 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:52:49,773 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 14:52:49,796 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:52:49,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 210 flow [2023-12-09 14:52:49,809 INFO L124 PetriNetUnfolderBase]: 9/141 cut-off events. [2023-12-09 14:52:49,809 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-09 14:52:49,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 141 events. 9/141 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 269 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 121. Up to 10 conditions per place. [2023-12-09 14:52:49,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 91 transitions, 210 flow [2023-12-09 14:52:49,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 91 transitions, 210 flow [2023-12-09 14:52:49,813 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:52:49,819 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2e244faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:52:49,819 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-09 14:52:49,822 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:52:49,822 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2023-12-09 14:52:49,822 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:52:49,822 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:49,823 INFO L233 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] [2023-12-09 14:52:49,823 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:52:49,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash 936111901, now seen corresponding path program 1 times [2023-12-09 14:52:49,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970903342] [2023-12-09 14:52:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970903342] [2023-12-09 14:52:49,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970903342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:49,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:49,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:49,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363626189] [2023-12-09 14:52:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:49,858 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:49,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:49,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:49,859 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 91 [2023-12-09 14:52:49,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 91 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-12-09 14:52:49,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:49,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 91 [2023-12-09 14:52:49,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:51,174 INFO L124 PetriNetUnfolderBase]: 7843/14697 cut-off events. [2023-12-09 14:52:51,175 INFO L125 PetriNetUnfolderBase]: For 4585/4585 co-relation queries the response was YES. [2023-12-09 14:52:51,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28573 conditions, 14697 events. 7843/14697 cut-off events. For 4585/4585 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 127294 event pairs, 4002 based on Foata normal form. 5503/19632 useless extension candidates. Maximal degree in co-relation 10656. Up to 7424 conditions per place. [2023-12-09 14:52:51,314 INFO L140 encePairwiseOnDemand]: 72/91 looper letters, 43 selfloop transitions, 9 changer transitions 0/99 dead transitions. [2023-12-09 14:52:51,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 99 transitions, 351 flow [2023-12-09 14:52:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2023-12-09 14:52:51,316 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2023-12-09 14:52:51,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2023-12-09 14:52:51,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2023-12-09 14:52:51,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:51,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2023-12-09 14:52:51,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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-12-09 14:52:51,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 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-12-09 14:52:51,318 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 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-12-09 14:52:51,319 INFO L308 CegarLoopForPetriNet]: 95 programPoint places, -8 predicate places. [2023-12-09 14:52:51,319 INFO L500 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 351 flow [2023-12-09 14:52:51,320 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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-12-09 14:52:51,320 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:51,320 INFO L233 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] [2023-12-09 14:52:51,320 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 14:52:51,320 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:52:51,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:51,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2100752586, now seen corresponding path program 1 times [2023-12-09 14:52:51,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:51,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369104573] [2023-12-09 14:52:51,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:51,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:52:51,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:51,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369104573] [2023-12-09 14:52:51,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369104573] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:51,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:51,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:51,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672360118] [2023-12-09 14:52:51,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:51,382 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:51,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:51,383 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 91 [2023-12-09 14:52:51,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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-12-09 14:52:51,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:51,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 91 [2023-12-09 14:52:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:52:51,453 INFO L124 PetriNetUnfolderBase]: 102/544 cut-off events. [2023-12-09 14:52:51,453 INFO L125 PetriNetUnfolderBase]: For 1210/1237 co-relation queries the response was YES. [2023-12-09 14:52:51,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 544 events. 102/544 cut-off events. For 1210/1237 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3616 event pairs, 52 based on Foata normal form. 254/789 useless extension candidates. Maximal degree in co-relation 510. Up to 263 conditions per place. [2023-12-09 14:52:51,455 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 16 selfloop transitions, 8 changer transitions 0/74 dead transitions. [2023-12-09 14:52:51,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 74 transitions, 328 flow [2023-12-09 14:52:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:52:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:52:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2023-12-09 14:52:51,457 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7838827838827839 [2023-12-09 14:52:51,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2023-12-09 14:52:51,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2023-12-09 14:52:51,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:52:51,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2023-12-09 14:52:51,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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-12-09 14:52:51,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 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-12-09 14:52:51,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 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-12-09 14:52:51,465 INFO L308 CegarLoopForPetriNet]: 95 programPoint places, -14 predicate places. [2023-12-09 14:52:51,465 INFO L500 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 328 flow [2023-12-09 14:52:51,465 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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-12-09 14:52:51,465 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:51,465 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:52:51,465 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 14:52:51,465 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-12-09 14:52:51,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1982397418, now seen corresponding path program 1 times [2023-12-09 14:52:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657007733] [2023-12-09 14:52:51,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:51,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:52:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:52:51,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:52:51,496 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:52:51,496 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-09 14:52:51,496 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-12-09 14:52:51,496 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-12-09 14:52:51,496 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-12-09 14:52:51,496 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-12-09 14:52:51,496 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-12-09 14:52:51,496 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 14:52:51,496 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:52:51,497 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:52:51,497 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-09 14:52:51,514 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:52:51,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 252 flow [2023-12-09 14:52:51,529 INFO L124 PetriNetUnfolderBase]: 11/169 cut-off events. [2023-12-09 14:52:51,529 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-09 14:52:51,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 169 events. 11/169 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 154. Up to 12 conditions per place. [2023-12-09 14:52:51,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 106 transitions, 252 flow [2023-12-09 14:52:51,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 106 transitions, 252 flow [2023-12-09 14:52:51,532 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:52:51,533 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2e244faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:52:51,533 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-09 14:52:51,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:52:51,535 INFO L124 PetriNetUnfolderBase]: 2/49 cut-off events. [2023-12-09 14:52:51,535 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:52:51,535 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:52:51,535 INFO L233 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] [2023-12-09 14:52:51,536 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:52:51,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:52:51,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1207675029, now seen corresponding path program 1 times [2023-12-09 14:52:51,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:52:51,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407292533] [2023-12-09 14:52:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:52:51,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:52:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:52:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:52:51,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:52:51,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407292533] [2023-12-09 14:52:51,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407292533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:52:51,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:52:51,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:52:51,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017412350] [2023-12-09 14:52:51,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:52:51,576 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:52:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:52:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:52:51,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:52:51,577 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 106 [2023-12-09 14:52:51,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 106 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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-12-09 14:52:51,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:52:51,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 106 [2023-12-09 14:52:51,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:53:02,649 INFO L124 PetriNetUnfolderBase]: 82238/134429 cut-off events. [2023-12-09 14:53:02,649 INFO L125 PetriNetUnfolderBase]: For 53459/53459 co-relation queries the response was YES. [2023-12-09 14:53:03,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267143 conditions, 134429 events. 82238/134429 cut-off events. For 53459/53459 co-relation queries the response was YES. Maximal size of possible extension queue 5143. Compared 1302579 event pairs, 45221 based on Foata normal form. 46598/174917 useless extension candidates. Maximal degree in co-relation 212367. Up to 67130 conditions per place. [2023-12-09 14:53:03,995 INFO L140 encePairwiseOnDemand]: 83/106 looper letters, 54 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2023-12-09 14:53:03,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 118 transitions, 438 flow [2023-12-09 14:53:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:53:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:53:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2023-12-09 14:53:03,998 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8113207547169812 [2023-12-09 14:53:03,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 258 transitions. [2023-12-09 14:53:03,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 258 transitions. [2023-12-09 14:53:03,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:53:03,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 258 transitions. [2023-12-09 14:53:03,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 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-12-09 14:53:04,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-12-09 14:53:04,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-12-09 14:53:04,001 INFO L308 CegarLoopForPetriNet]: 111 programPoint places, -9 predicate places. [2023-12-09 14:53:04,001 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 438 flow [2023-12-09 14:53:04,001 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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-12-09 14:53:04,001 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:53:04,001 INFO L233 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] [2023-12-09 14:53:04,001 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 14:53:04,001 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:53:04,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:53:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash 998595296, now seen corresponding path program 1 times [2023-12-09 14:53:04,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:53:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432404093] [2023-12-09 14:53:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:53:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:53:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:53:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-09 14:53:04,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:53:04,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432404093] [2023-12-09 14:53:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432404093] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:53:04,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:53:04,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:53:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150100527] [2023-12-09 14:53:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:53:04,102 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:53:04,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:53:04,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:53:04,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:53:04,102 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 106 [2023-12-09 14:53:04,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 118 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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-12-09 14:53:04,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:53:04,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 106 [2023-12-09 14:53:04,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:53:04,237 INFO L124 PetriNetUnfolderBase]: 294/1346 cut-off events. [2023-12-09 14:53:04,237 INFO L125 PetriNetUnfolderBase]: For 4581/4696 co-relation queries the response was YES. [2023-12-09 14:53:04,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3962 conditions, 1346 events. 294/1346 cut-off events. For 4581/4696 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11610 event pairs, 79 based on Foata normal form. 898/2222 useless extension candidates. Maximal degree in co-relation 1539. Up to 695 conditions per place. [2023-12-09 14:53:04,247 INFO L140 encePairwiseOnDemand]: 96/106 looper letters, 19 selfloop transitions, 10 changer transitions 0/87 dead transitions. [2023-12-09 14:53:04,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 414 flow [2023-12-09 14:53:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:53:04,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:53:04,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2023-12-09 14:53:04,249 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7830188679245284 [2023-12-09 14:53:04,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 249 transitions. [2023-12-09 14:53:04,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 249 transitions. [2023-12-09 14:53:04,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:53:04,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 249 transitions. [2023-12-09 14:53:04,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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-12-09 14:53:04,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-12-09 14:53:04,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-12-09 14:53:04,253 INFO L308 CegarLoopForPetriNet]: 111 programPoint places, -17 predicate places. [2023-12-09 14:53:04,253 INFO L500 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 414 flow [2023-12-09 14:53:04,253 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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-12-09 14:53:04,253 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:53:04,253 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:53:04,253 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 14:53:04,253 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-09 14:53:04,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:53:04,254 INFO L85 PathProgramCache]: Analyzing trace with hash 978245230, now seen corresponding path program 1 times [2023-12-09 14:53:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:53:04,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939745003] [2023-12-09 14:53:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:53:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:53:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:53:04,265 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 14:53:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 14:53:04,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 14:53:04,281 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 14:53:04,281 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-12-09 14:53:04,281 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-09 14:53:04,281 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-09 14:53:04,281 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-09 14:53:04,282 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-09 14:53:04,282 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-09 14:53:04,282 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-09 14:53:04,282 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 14:53:04,282 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 14:53:04,285 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 14:53:04,285 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-09 14:53:04,310 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-09 14:53:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 121 transitions, 296 flow [2023-12-09 14:53:04,322 INFO L124 PetriNetUnfolderBase]: 13/197 cut-off events. [2023-12-09 14:53:04,322 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-09 14:53:04,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 197 events. 13/197 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 402 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 188. Up to 14 conditions per place. [2023-12-09 14:53:04,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 121 transitions, 296 flow [2023-12-09 14:53:04,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 121 transitions, 296 flow [2023-12-09 14:53:04,325 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:53:04,325 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@2e244faa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:53:04,325 INFO L363 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-12-09 14:53:04,327 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:53:04,327 INFO L124 PetriNetUnfolderBase]: 2/48 cut-off events. [2023-12-09 14:53:04,327 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 14:53:04,327 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:53:04,327 INFO L233 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] [2023-12-09 14:53:04,328 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-12-09 14:53:04,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:53:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1244002218, now seen corresponding path program 1 times [2023-12-09 14:53:04,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:53:04,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782530228] [2023-12-09 14:53:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:53:04,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:53:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:53:04,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:53:04,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:53:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782530228] [2023-12-09 14:53:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782530228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:53:04,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:53:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:53:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703246814] [2023-12-09 14:53:04,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:53:04,363 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:53:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:53:04,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:53:04,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:53:04,365 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 121 [2023-12-09 14:53:04,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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-12-09 14:53:04,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:53:04,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 121 [2023-12-09 14:53:04,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand