/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:04:12,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:04:12,653 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-05 21:04:12,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:04:12,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:04:12,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:04:12,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:04:12,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:04:12,682 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:04:12,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:04:12,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:04:12,686 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:04:12,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:04:12,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:04:12,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:04:12,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:04:12,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:04:12,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:04:12,688 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:04:12,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:04:12,688 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:04:12,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:04:12,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:04:12,689 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:04:12,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:04:12,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:12,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:04:12,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:04:12,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:04:12,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:04:12,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:04:12,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:04:12,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:04:12,691 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:04:12,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:04:12,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:04:12,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:04:12,899 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:04:12,899 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:04:12,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs-pthread.i [2023-12-05 21:04:13,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:04:14,180 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:04:14,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs-pthread.i [2023-12-05 21:04:14,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691b92148/6be42e2f58ef4c8e821b60f780bc4d68/FLAGf53bf5e91 [2023-12-05 21:04:14,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/691b92148/6be42e2f58ef4c8e821b60f780bc4d68 [2023-12-05 21:04:14,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:04:14,204 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:04:14,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:14,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:04:14,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:04:14,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ffb002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14, skipping insertion in model container [2023-12-05 21:04:14,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,233 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:04:14,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:14,419 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:04:14,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:14,471 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:04:14,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14 WrapperNode [2023-12-05 21:04:14,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:14,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:14,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:04:14,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:04:14,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,506 INFO L138 Inliner]: procedures = 163, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-12-05 21:04:14,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:14,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:04:14,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:04:14,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:04:14,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,536 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:04:14,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:04:14,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:04:14,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:04:14,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (1/1) ... [2023-12-05 21:04:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:14,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:04:14,608 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-05 21:04:14,611 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-05 21:04:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-12-05 21:04:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-12-05 21:04:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:04:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:04:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:04:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:04:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:04:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:04:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:04:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:04:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:04:14,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:04:14,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:04:14,653 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:04:14,735 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:04:14,736 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:04:14,902 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:04:14,917 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:04:14,917 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-05 21:04:14,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:14 BoogieIcfgContainer [2023-12-05 21:04:14,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:04:14,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:04:14,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:04:14,922 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:04:14,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:04:14" (1/3) ... [2023-12-05 21:04:14,922 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fc5a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:14, skipping insertion in model container [2023-12-05 21:04:14,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:14" (2/3) ... [2023-12-05 21:04:14,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fc5a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:14, skipping insertion in model container [2023-12-05 21:04:14,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:14" (3/3) ... [2023-12-05 21:04:14,923 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs-pthread.i [2023-12-05 21:04:14,935 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:04:14,935 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:04:14,935 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:04:15,016 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:15,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 79 transitions, 166 flow [2023-12-05 21:04:15,068 INFO L124 PetriNetUnfolderBase]: 8/91 cut-off events. [2023-12-05 21:04:15,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:15,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 8/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2023-12-05 21:04:15,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 79 transitions, 166 flow [2023-12-05 21:04:15,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 78 transitions, 163 flow [2023-12-05 21:04:15,083 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:15,089 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;@6a7164a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:15,089 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:15,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:15,095 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-12-05 21:04:15,095 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:15,095 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:15,095 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] [2023-12-05 21:04:15,096 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:15,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 203619419, now seen corresponding path program 1 times [2023-12-05 21:04:15,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:15,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067080501] [2023-12-05 21:04:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:15,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:15,386 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-05 21:04:15,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:15,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067080501] [2023-12-05 21:04:15,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067080501] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:15,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:15,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:15,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878587409] [2023-12-05 21:04:15,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:15,394 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:15,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:15,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:15,433 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 79 [2023-12-05 21:04:15,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-05 21:04:15,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:15,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 79 [2023-12-05 21:04:15,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:15,503 INFO L124 PetriNetUnfolderBase]: 55/222 cut-off events. [2023-12-05 21:04:15,503 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:15,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 222 events. 55/222 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 831 event pairs, 34 based on Foata normal form. 71/271 useless extension candidates. Maximal degree in co-relation 289. Up to 90 conditions per place. [2023-12-05 21:04:15,507 INFO L140 encePairwiseOnDemand]: 68/79 looper letters, 15 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-12-05 21:04:15,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 151 flow [2023-12-05 21:04:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:15,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2023-12-05 21:04:15,517 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.729957805907173 [2023-12-05 21:04:15,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 173 transitions. [2023-12-05 21:04:15,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 173 transitions. [2023-12-05 21:04:15,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:15,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 173 transitions. [2023-12-05 21:04:15,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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-05 21:04:15,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 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-05 21:04:15,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 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-05 21:04:15,528 INFO L308 CegarLoopForPetriNet]: 77 programPoint places, -15 predicate places. [2023-12-05 21:04:15,528 INFO L500 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 151 flow [2023-12-05 21:04:15,529 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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-05 21:04:15,529 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:15,529 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] [2023-12-05 21:04:15,529 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:04:15,529 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:15,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 203619420, now seen corresponding path program 1 times [2023-12-05 21:04:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494414550] [2023-12-05 21:04:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:15,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:15,627 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-05 21:04:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494414550] [2023-12-05 21:04:15,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494414550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:15,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:15,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:15,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296827571] [2023-12-05 21:04:15,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:15,636 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:15,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:15,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:15,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:15,640 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 79 [2023-12-05 21:04:15,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 151 flow. Second operand has 3 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-05 21:04:15,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:15,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 79 [2023-12-05 21:04:15,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:15,691 INFO L124 PetriNetUnfolderBase]: 34/160 cut-off events. [2023-12-05 21:04:15,691 INFO L125 PetriNetUnfolderBase]: For 33/45 co-relation queries the response was YES. [2023-12-05 21:04:15,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 160 events. 34/160 cut-off events. For 33/45 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 481 event pairs, 20 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 248. Up to 56 conditions per place. [2023-12-05 21:04:15,699 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 12 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-12-05 21:04:15,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 169 flow [2023-12-05 21:04:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2023-12-05 21:04:15,701 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6962025316455697 [2023-12-05 21:04:15,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 165 transitions. [2023-12-05 21:04:15,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 165 transitions. [2023-12-05 21:04:15,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:15,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 165 transitions. [2023-12-05 21:04:15,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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-05 21:04:15,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 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-05 21:04:15,704 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 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-05 21:04:15,705 INFO L308 CegarLoopForPetriNet]: 77 programPoint places, -15 predicate places. [2023-12-05 21:04:15,705 INFO L500 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 169 flow [2023-12-05 21:04:15,706 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-05 21:04:15,706 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:15,706 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] [2023-12-05 21:04:15,706 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:04:15,706 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:15,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1668461742, now seen corresponding path program 1 times [2023-12-05 21:04:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:15,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969813124] [2023-12-05 21:04:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:15,730 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:15,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:15,768 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:15,769 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:15,771 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:15,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:15,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:15,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:15,772 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:15,773 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:04:15,774 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:15,779 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:15,779 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:04:15,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:15,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 114 transitions, 248 flow [2023-12-05 21:04:15,838 INFO L124 PetriNetUnfolderBase]: 11/121 cut-off events. [2023-12-05 21:04:15,838 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:15,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 121 events. 11/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 264 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 128. Up to 6 conditions per place. [2023-12-05 21:04:15,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 114 transitions, 248 flow [2023-12-05 21:04:15,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 93 transitions, 199 flow [2023-12-05 21:04:15,851 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:15,851 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;@6a7164a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:15,852 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:15,854 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:15,855 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-12-05 21:04:15,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:15,855 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:15,859 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] [2023-12-05 21:04:15,859 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:15,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 807987213, now seen corresponding path program 1 times [2023-12-05 21:04:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:15,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75783649] [2023-12-05 21:04:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:15,931 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-05 21:04:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75783649] [2023-12-05 21:04:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75783649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:15,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:15,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443959435] [2023-12-05 21:04:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:15,932 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:15,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:15,934 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 114 [2023-12-05 21:04:15,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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-05 21:04:15,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:15,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 114 [2023-12-05 21:04:15,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:16,072 INFO L124 PetriNetUnfolderBase]: 280/768 cut-off events. [2023-12-05 21:04:16,072 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-12-05 21:04:16,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 768 events. 280/768 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4277 event pairs, 178 based on Foata normal form. 302/1003 useless extension candidates. Maximal degree in co-relation 1159. Up to 387 conditions per place. [2023-12-05 21:04:16,081 INFO L140 encePairwiseOnDemand]: 101/114 looper letters, 18 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2023-12-05 21:04:16,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 185 flow [2023-12-05 21:04:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-12-05 21:04:16,087 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7134502923976608 [2023-12-05 21:04:16,087 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-12-05 21:04:16,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-12-05 21:04:16,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:16,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-12-05 21:04:16,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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-05 21:04:16,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:16,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:16,093 INFO L308 CegarLoopForPetriNet]: 92 programPoint places, -18 predicate places. [2023-12-05 21:04:16,093 INFO L500 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 185 flow [2023-12-05 21:04:16,093 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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-05 21:04:16,093 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:16,093 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] [2023-12-05 21:04:16,093 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:04:16,094 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:16,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:16,094 INFO L85 PathProgramCache]: Analyzing trace with hash 807987214, now seen corresponding path program 1 times [2023-12-05 21:04:16,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051064635] [2023-12-05 21:04:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:16,180 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-05 21:04:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:16,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051064635] [2023-12-05 21:04:16,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051064635] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:16,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:16,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:16,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852225859] [2023-12-05 21:04:16,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:16,182 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:16,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:16,184 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 114 [2023-12-05 21:04:16,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-05 21:04:16,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:16,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 114 [2023-12-05 21:04:16,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:16,289 INFO L124 PetriNetUnfolderBase]: 178/535 cut-off events. [2023-12-05 21:04:16,290 INFO L125 PetriNetUnfolderBase]: For 126/180 co-relation queries the response was YES. [2023-12-05 21:04:16,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 535 events. 178/535 cut-off events. For 126/180 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2649 event pairs, 110 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1028. Up to 245 conditions per place. [2023-12-05 21:04:16,293 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 15 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2023-12-05 21:04:16,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 209 flow [2023-12-05 21:04:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:16,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:16,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2023-12-05 21:04:16,295 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2023-12-05 21:04:16,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2023-12-05 21:04:16,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2023-12-05 21:04:16,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:16,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2023-12-05 21:04:16,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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-05 21:04:16,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:16,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:16,298 INFO L308 CegarLoopForPetriNet]: 92 programPoint places, -18 predicate places. [2023-12-05 21:04:16,298 INFO L500 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 209 flow [2023-12-05 21:04:16,298 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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-05 21:04:16,298 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:16,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:16,299 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:04:16,299 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:16,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1945452585, now seen corresponding path program 1 times [2023-12-05 21:04:16,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486209043] [2023-12-05 21:04:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:16,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:16,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:16,347 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:16,348 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:16,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:16,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:16,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:16,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:16,348 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:16,348 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:04:16,348 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:16,349 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:16,349 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:04:16,383 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:16,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 149 transitions, 334 flow [2023-12-05 21:04:16,404 INFO L124 PetriNetUnfolderBase]: 14/151 cut-off events. [2023-12-05 21:04:16,405 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:04:16,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 151 events. 14/151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 352 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 162. Up to 8 conditions per place. [2023-12-05 21:04:16,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 149 transitions, 334 flow [2023-12-05 21:04:16,406 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 108 transitions, 237 flow [2023-12-05 21:04:16,407 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:16,407 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;@6a7164a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:16,407 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:16,412 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:16,413 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-12-05 21:04:16,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:16,413 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:16,413 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] [2023-12-05 21:04:16,413 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:16,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:16,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1529131070, now seen corresponding path program 1 times [2023-12-05 21:04:16,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:16,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249997656] [2023-12-05 21:04:16,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:16,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:16,439 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-05 21:04:16,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:16,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249997656] [2023-12-05 21:04:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249997656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:16,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:16,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:16,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860970675] [2023-12-05 21:04:16,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:16,443 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:16,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:16,446 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 149 [2023-12-05 21:04:16,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-05 21:04:16,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:16,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 149 [2023-12-05 21:04:16,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:16,726 INFO L124 PetriNetUnfolderBase]: 1198/2649 cut-off events. [2023-12-05 21:04:16,726 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2023-12-05 21:04:16,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 2649 events. 1198/2649 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17943 event pairs, 772 based on Foata normal form. 1157/3604 useless extension candidates. Maximal degree in co-relation 4282. Up to 1521 conditions per place. [2023-12-05 21:04:16,779 INFO L140 encePairwiseOnDemand]: 134/149 looper letters, 21 selfloop transitions, 1 changer transitions 0/78 dead transitions. [2023-12-05 21:04:16,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 78 transitions, 221 flow [2023-12-05 21:04:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-12-05 21:04:16,832 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7046979865771812 [2023-12-05 21:04:16,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-12-05 21:04:16,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-12-05 21:04:16,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:16,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-12-05 21:04:16,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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-05 21:04:16,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 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-05 21:04:16,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 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-05 21:04:16,835 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, -21 predicate places. [2023-12-05 21:04:16,835 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 221 flow [2023-12-05 21:04:16,835 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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-05 21:04:16,835 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:16,835 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] [2023-12-05 21:04:16,835 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:04:16,836 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:16,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1529131069, now seen corresponding path program 1 times [2023-12-05 21:04:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475842574] [2023-12-05 21:04:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:16,885 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-05 21:04:16,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:16,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475842574] [2023-12-05 21:04:16,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475842574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:16,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:16,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912341387] [2023-12-05 21:04:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:16,889 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:16,890 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 149 [2023-12-05 21:04:16,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-05 21:04:16,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:16,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 149 [2023-12-05 21:04:16,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:17,056 INFO L124 PetriNetUnfolderBase]: 772/1822 cut-off events. [2023-12-05 21:04:17,057 INFO L125 PetriNetUnfolderBase]: For 522/702 co-relation queries the response was YES. [2023-12-05 21:04:17,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1822 events. 772/1822 cut-off events. For 522/702 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 11745 event pairs, 488 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 3881. Up to 974 conditions per place. [2023-12-05 21:04:17,073 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 18 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2023-12-05 21:04:17,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 76 transitions, 251 flow [2023-12-05 21:04:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-12-05 21:04:17,074 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6778523489932886 [2023-12-05 21:04:17,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-12-05 21:04:17,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-12-05 21:04:17,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:17,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-12-05 21:04:17,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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-05 21:04:17,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 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-05 21:04:17,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 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-05 21:04:17,077 INFO L308 CegarLoopForPetriNet]: 107 programPoint places, -21 predicate places. [2023-12-05 21:04:17,077 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 251 flow [2023-12-05 21:04:17,077 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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-05 21:04:17,078 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:17,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:17,078 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:04:17,078 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:17,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:17,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1584663601, now seen corresponding path program 1 times [2023-12-05 21:04:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238645534] [2023-12-05 21:04:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:17,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:17,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:17,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:17,120 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:17,121 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:17,123 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:17,124 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:17,124 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:17,124 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:17,124 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:17,124 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:04:17,125 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:17,126 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:17,126 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:04:17,163 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:17,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 184 transitions, 424 flow [2023-12-05 21:04:17,178 INFO L124 PetriNetUnfolderBase]: 17/181 cut-off events. [2023-12-05 21:04:17,178 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:04:17,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 181 events. 17/181 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 432 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 197. Up to 10 conditions per place. [2023-12-05 21:04:17,179 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 184 transitions, 424 flow [2023-12-05 21:04:17,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 123 transitions, 277 flow [2023-12-05 21:04:17,182 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:17,183 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;@6a7164a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:17,183 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:17,185 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:17,185 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-12-05 21:04:17,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:17,186 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:17,186 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] [2023-12-05 21:04:17,186 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:17,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:17,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1782199162, now seen corresponding path program 1 times [2023-12-05 21:04:17,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:17,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503113032] [2023-12-05 21:04:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:17,228 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-05 21:04:17,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:17,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503113032] [2023-12-05 21:04:17,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503113032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:17,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:17,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:17,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040571024] [2023-12-05 21:04:17,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:17,229 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:17,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:17,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:17,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:17,230 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 184 [2023-12-05 21:04:17,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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-05 21:04:17,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:17,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 184 [2023-12-05 21:04:17,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:18,221 INFO L124 PetriNetUnfolderBase]: 4681/9021 cut-off events. [2023-12-05 21:04:18,222 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2023-12-05 21:04:18,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15233 conditions, 9021 events. 4681/9021 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 69645 event pairs, 3040 based on Foata normal form. 4208/12622 useless extension candidates. Maximal degree in co-relation 15190. Up to 5652 conditions per place. [2023-12-05 21:04:18,284 INFO L140 encePairwiseOnDemand]: 167/184 looper letters, 24 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:04:18,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 259 flow [2023-12-05 21:04:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-12-05 21:04:18,285 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6992753623188406 [2023-12-05 21:04:18,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-12-05 21:04:18,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-12-05 21:04:18,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:18,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-12-05 21:04:18,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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-05 21:04:18,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-05 21:04:18,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-05 21:04:18,289 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2023-12-05 21:04:18,289 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 259 flow [2023-12-05 21:04:18,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 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-05 21:04:18,289 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:18,289 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] [2023-12-05 21:04:18,289 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:04:18,289 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:18,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:18,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1782199163, now seen corresponding path program 1 times [2023-12-05 21:04:18,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:18,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913635363] [2023-12-05 21:04:18,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:18,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:18,325 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-05 21:04:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913635363] [2023-12-05 21:04:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913635363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380948741] [2023-12-05 21:04:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:18,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:18,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:18,327 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 184 [2023-12-05 21:04:18,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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-05 21:04:18,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:18,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 184 [2023-12-05 21:04:18,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:18,983 INFO L124 PetriNetUnfolderBase]: 3040/6169 cut-off events. [2023-12-05 21:04:18,984 INFO L125 PetriNetUnfolderBase]: For 2196/2754 co-relation queries the response was YES. [2023-12-05 21:04:19,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14028 conditions, 6169 events. 3040/6169 cut-off events. For 2196/2754 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 46129 event pairs, 1946 based on Foata normal form. 0/5927 useless extension candidates. Maximal degree in co-relation 13979. Up to 3647 conditions per place. [2023-12-05 21:04:19,038 INFO L140 encePairwiseOnDemand]: 181/184 looper letters, 21 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-12-05 21:04:19,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 87 transitions, 295 flow [2023-12-05 21:04:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-12-05 21:04:19,040 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2023-12-05 21:04:19,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-12-05 21:04:19,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-12-05 21:04:19,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:19,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-12-05 21:04:19,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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-05 21:04:19,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-05 21:04:19,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 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-05 21:04:19,044 INFO L308 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2023-12-05 21:04:19,044 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 295 flow [2023-12-05 21:04:19,044 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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-05 21:04:19,044 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:19,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:19,044 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:04:19,044 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:19,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:19,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1293118267, now seen corresponding path program 1 times [2023-12-05 21:04:19,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:19,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204940391] [2023-12-05 21:04:19,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:19,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:19,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:19,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:19,084 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:19,084 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:19,084 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:19,084 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:19,084 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:19,085 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:19,085 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:19,086 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:04:19,086 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:19,086 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:19,086 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:04:19,168 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:19,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 219 transitions, 518 flow [2023-12-05 21:04:19,182 INFO L124 PetriNetUnfolderBase]: 20/211 cut-off events. [2023-12-05 21:04:19,182 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:04:19,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 211 events. 20/211 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 521 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 233. Up to 12 conditions per place. [2023-12-05 21:04:19,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 219 transitions, 518 flow [2023-12-05 21:04:19,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 138 transitions, 319 flow [2023-12-05 21:04:19,187 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:19,188 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;@6a7164a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:19,188 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:19,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:19,189 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-12-05 21:04:19,189 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:19,189 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:19,189 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] [2023-12-05 21:04:19,189 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:19,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2142923979, now seen corresponding path program 1 times [2023-12-05 21:04:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:19,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057960900] [2023-12-05 21:04:19,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:19,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:19,217 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-05 21:04:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057960900] [2023-12-05 21:04:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057960900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310716393] [2023-12-05 21:04:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:19,218 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:19,219 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 219 [2023-12-05 21:04:19,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 138 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-05 21:04:19,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:19,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 219 [2023-12-05 21:04:19,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:22,418 INFO L124 PetriNetUnfolderBase]: 17317/30324 cut-off events. [2023-12-05 21:04:22,419 INFO L125 PetriNetUnfolderBase]: For 6530/6530 co-relation queries the response was YES. [2023-12-05 21:04:22,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52575 conditions, 30324 events. 17317/30324 cut-off events. For 6530/6530 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 253394 event pairs, 11302 based on Foata normal form. 14819/43321 useless extension candidates. Maximal degree in co-relation 52531. Up to 20232 conditions per place. [2023-12-05 21:04:22,748 INFO L140 encePairwiseOnDemand]: 200/219 looper letters, 27 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2023-12-05 21:04:22,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 100 transitions, 299 flow [2023-12-05 21:04:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:22,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:22,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-12-05 21:04:22,749 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.69558599695586 [2023-12-05 21:04:22,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-12-05 21:04:22,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-12-05 21:04:22,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:22,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-12-05 21:04:22,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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-05 21:04:22,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 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-05 21:04:22,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 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-05 21:04:22,754 INFO L308 CegarLoopForPetriNet]: 137 programPoint places, -27 predicate places. [2023-12-05 21:04:22,754 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 299 flow [2023-12-05 21:04:22,754 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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-05 21:04:22,754 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:22,755 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] [2023-12-05 21:04:22,755 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:04:22,755 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:22,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash -2142923978, now seen corresponding path program 1 times [2023-12-05 21:04:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995121621] [2023-12-05 21:04:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:22,797 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-05 21:04:22,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:22,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995121621] [2023-12-05 21:04:22,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995121621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:22,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:22,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:22,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831835266] [2023-12-05 21:04:22,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:22,798 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:22,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:22,799 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 219 [2023-12-05 21:04:22,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-05 21:04:22,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:22,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 219 [2023-12-05 21:04:22,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:24,943 INFO L124 PetriNetUnfolderBase]: 11302/20668 cut-off events. [2023-12-05 21:04:24,943 INFO L125 PetriNetUnfolderBase]: For 9081/10773 co-relation queries the response was YES. [2023-12-05 21:04:25,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48940 conditions, 20668 events. 11302/20668 cut-off events. For 9081/10773 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 171190 event pairs, 7292 based on Foata normal form. 0/19940 useless extension candidates. Maximal degree in co-relation 48890. Up to 13124 conditions per place. [2023-12-05 21:04:25,157 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 24 selfloop transitions, 1 changer transitions 0/98 dead transitions. [2023-12-05 21:04:25,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 98 transitions, 341 flow [2023-12-05 21:04:25,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-12-05 21:04:25,158 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6712328767123288 [2023-12-05 21:04:25,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-12-05 21:04:25,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-12-05 21:04:25,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:25,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-12-05 21:04:25,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:25,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 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-05 21:04:25,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 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-05 21:04:25,161 INFO L308 CegarLoopForPetriNet]: 137 programPoint places, -27 predicate places. [2023-12-05 21:04:25,162 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 341 flow [2023-12-05 21:04:25,162 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-05 21:04:25,162 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:25,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:25,162 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:04:25,162 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:25,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:25,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1778195632, now seen corresponding path program 1 times [2023-12-05 21:04:25,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:25,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297985337] [2023-12-05 21:04:25,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:25,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:25,182 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:25,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:25,200 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:25,200 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:25,200 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:25,201 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:25,201 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:25,201 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:25,201 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:25,201 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:04:25,201 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:25,201 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:25,201 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:04:25,235 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:25,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 254 transitions, 616 flow [2023-12-05 21:04:25,367 INFO L124 PetriNetUnfolderBase]: 23/241 cut-off events. [2023-12-05 21:04:25,367 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:04:25,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 241 events. 23/241 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 577 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 270. Up to 14 conditions per place. [2023-12-05 21:04:25,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 254 transitions, 616 flow [2023-12-05 21:04:25,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 153 transitions, 363 flow [2023-12-05 21:04:25,370 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:25,370 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;@6a7164a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:25,370 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:25,371 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:25,371 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-12-05 21:04:25,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:25,371 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:25,371 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] [2023-12-05 21:04:25,372 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:25,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:25,372 INFO L85 PathProgramCache]: Analyzing trace with hash -419598605, now seen corresponding path program 1 times [2023-12-05 21:04:25,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:25,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045895838] [2023-12-05 21:04:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:25,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:25,423 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-05 21:04:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:25,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045895838] [2023-12-05 21:04:25,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045895838] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:25,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:25,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:25,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651370253] [2023-12-05 21:04:25,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:25,424 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:25,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:25,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:25,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:25,425 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 254 [2023-12-05 21:04:25,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 153 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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-05 21:04:25,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:25,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 254 [2023-12-05 21:04:25,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:38,146 INFO L124 PetriNetUnfolderBase]: 61786/100794 cut-off events. [2023-12-05 21:04:38,147 INFO L125 PetriNetUnfolderBase]: For 28886/28886 co-relation queries the response was YES. [2023-12-05 21:04:38,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178450 conditions, 100794 events. 61786/100794 cut-off events. For 28886/28886 co-relation queries the response was YES. Maximal size of possible extension queue 3101. Compared 894974 event pairs, 40462 based on Foata normal form. 51026/146353 useless extension candidates. Maximal degree in co-relation 178405. Up to 70533 conditions per place. [2023-12-05 21:04:39,572 INFO L140 encePairwiseOnDemand]: 233/254 looper letters, 30 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2023-12-05 21:04:39,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 111 transitions, 341 flow [2023-12-05 21:04:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:39,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2023-12-05 21:04:39,588 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6929133858267716 [2023-12-05 21:04:39,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2023-12-05 21:04:39,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2023-12-05 21:04:39,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:39,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2023-12-05 21:04:39,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:39,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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-05 21:04:39,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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-05 21:04:39,591 INFO L308 CegarLoopForPetriNet]: 152 programPoint places, -30 predicate places. [2023-12-05 21:04:39,591 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 341 flow [2023-12-05 21:04:39,591 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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-05 21:04:39,591 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:39,591 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] [2023-12-05 21:04:39,592 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:04:39,592 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:39,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash -419598604, now seen corresponding path program 1 times [2023-12-05 21:04:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285068765] [2023-12-05 21:04:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:39,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:39,641 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-05 21:04:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:39,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285068765] [2023-12-05 21:04:39,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285068765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:39,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:39,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709453783] [2023-12-05 21:04:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:39,642 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:39,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:39,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:39,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:39,644 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 254 [2023-12-05 21:04:39,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-05 21:04:39,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:39,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 254 [2023-12-05 21:04:39,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:47,574 INFO L124 PetriNetUnfolderBase]: 40462/68539 cut-off events. [2023-12-05 21:04:47,574 INFO L125 PetriNetUnfolderBase]: For 36540/41634 co-relation queries the response was YES. [2023-12-05 21:04:48,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167525 conditions, 68539 events. 40462/68539 cut-off events. For 36540/41634 co-relation queries the response was YES. Maximal size of possible extension queue 2180. Compared 606659 event pairs, 26246 based on Foata normal form. 0/66353 useless extension candidates. Maximal degree in co-relation 167474. Up to 45929 conditions per place. [2023-12-05 21:04:48,631 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 27 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-12-05 21:04:48,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 109 transitions, 389 flow [2023-12-05 21:04:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-12-05 21:04:48,633 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6692913385826772 [2023-12-05 21:04:48,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-12-05 21:04:48,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-12-05 21:04:48,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:48,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-12-05 21:04:48,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 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-05 21:04:48,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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-05 21:04:48,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 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-05 21:04:48,636 INFO L308 CegarLoopForPetriNet]: 152 programPoint places, -30 predicate places. [2023-12-05 21:04:48,636 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 389 flow [2023-12-05 21:04:48,636 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 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-05 21:04:48,636 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:48,637 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:04:48,637 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:04:48,637 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:48,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash 236054911, now seen corresponding path program 1 times [2023-12-05 21:04:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:48,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231459714] [2023-12-05 21:04:48,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:48,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:48,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:48,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:48,692 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:48,692 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-12-05 21:04:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-12-05 21:04:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-12-05 21:04:48,692 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-12-05 21:04:48,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-12-05 21:04:48,693 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-12-05 21:04:48,693 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:04:48,693 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:48,694 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:48,694 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-12-05 21:04:48,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:48,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 289 transitions, 718 flow [2023-12-05 21:04:48,748 INFO L124 PetriNetUnfolderBase]: 26/271 cut-off events. [2023-12-05 21:04:48,748 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:04:48,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 271 events. 26/271 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 645 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 308. Up to 16 conditions per place. [2023-12-05 21:04:48,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 289 transitions, 718 flow [2023-12-05 21:04:48,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 168 transitions, 409 flow [2023-12-05 21:04:48,752 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:48,752 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;@6a7164a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:48,752 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-05 21:04:48,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:48,753 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-12-05 21:04:48,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:48,753 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:48,753 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] [2023-12-05 21:04:48,753 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:04:48,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:48,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1637759308, now seen corresponding path program 1 times [2023-12-05 21:04:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:48,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653327110] [2023-12-05 21:04:48,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:48,776 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-05 21:04:48,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653327110] [2023-12-05 21:04:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653327110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987749074] [2023-12-05 21:04:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:48,776 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:48,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:48,778 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 289 [2023-12-05 21:04:48,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 168 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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-05 21:04:48,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:48,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 289 [2023-12-05 21:04:48,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:39,806 INFO L124 PetriNetUnfolderBase]: 214876/331887 cut-off events. [2023-12-05 21:05:39,807 INFO L125 PetriNetUnfolderBase]: For 120011/120011 co-relation queries the response was YES. [2023-12-05 21:05:43,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597626 conditions, 331887 events. 214876/331887 cut-off events. For 120011/120011 co-relation queries the response was YES. Maximal size of possible extension queue 8853. Compared 3075679 event pairs, 141064 based on Foata normal form. 172769/488254 useless extension candidates. Maximal degree in co-relation 597580. Up to 241119 conditions per place. [2023-12-05 21:05:47,339 INFO L140 encePairwiseOnDemand]: 266/289 looper letters, 33 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2023-12-05 21:05:47,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 122 transitions, 385 flow [2023-12-05 21:05:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions. [2023-12-05 21:05:47,343 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6908881199538639 [2023-12-05 21:05:47,343 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 599 transitions. [2023-12-05 21:05:47,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions. [2023-12-05 21:05:47,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:47,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions. [2023-12-05 21:05:47,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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-05 21:05:47,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 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-05 21:05:47,347 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 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-05 21:05:47,348 INFO L308 CegarLoopForPetriNet]: 167 programPoint places, -33 predicate places. [2023-12-05 21:05:47,348 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 385 flow [2023-12-05 21:05:47,348 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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-05 21:05:47,348 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:47,348 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] [2023-12-05 21:05:47,362 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 21:05:47,363 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-12-05 21:05:47,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:47,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1637759307, now seen corresponding path program 1 times [2023-12-05 21:05:47,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:47,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266155994] [2023-12-05 21:05:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:47,446 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-05 21:05:47,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266155994] [2023-12-05 21:05:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266155994] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488452007] [2023-12-05 21:05:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:47,448 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:47,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:47,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:47,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:47,449 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 289 [2023-12-05 21:05:47,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 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-05 21:05:47,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:47,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 289 [2023-12-05 21:05:47,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand